Skip to main content
SpringerLink
Log in

The weighted Sperner's Set problem

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1980 (MFCS 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 88))

Abstract

A polynomial time bounded algorithm is presented for solving the Weighted Sperner's Set Problem, that is, the problem of computing an independent Set of maximal weight on a weighted partially ordered set.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berenguer X., Diaz J., Harper L.H. “A solution to the Sperner-Erdös Problem”, manuscript in preparation.

    Google Scholar 

  2. Even S. “The Max Flow Algorithm of Dinic and Karzanov: an exposition” MIT/LCS/TM-80 (1976).

    Google Scholar 

  3. Golumbic M.C. “Algorithmic Graph Theory and Perfect Graphs”, Academic Press, N.Y. (1980).

    Google Scholar 

  4. Lawler E. “Combinatorial Optimization: Networks and Matroids”, Hold Rinehart and Winston, N.Y. (1976).

    Google Scholar 

  5. Rota G.C., Harper L.H. “Matching theory: an introduction”, in Advances in Probability, vol. 1, pp. 171–215, N.Y. (1971).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultat d'Informàtica, Universitat Politècnica de Barcelona, Barcelona, Spain

    X. Berenguer & J. Diaz

Authors
  1. X. Berenguer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Diaz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berenguer, X., Diaz, J. (1980). The weighted Sperner's Set problem. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022500

Download citation

  • DOI: https://doi.org/10.1007/BFb0022500

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation