Skip to main content
SpringerLink
Log in

On Greedy and Submodular Matrices

  • Conference paper
Theory and Practice of Algorithms in (Computer) Systems (TAPAS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6595))

Abstract

We characterize non-negative greedy matrices, i.e., (0,1)-matrices A such that the problem max {c T x|Ax ≤ b, x ≥ 0} can be solved greedily. We identify so-called submodular matrices as a special subclass of greedy matrices. Finally, we extend the notion of greediness to { − 1,0,1}-matrices. We present numerous applications of these concepts.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borradaile, G., Klein, P.: An O(nlogn) algorithm for maximum st-flow in a directed planar graph. In: SODA 2006 Proceedings, pp. 524–533 (2006)

    Google Scholar 

  2. Hoffman, A.J.: On greedy algorithms for series parallel graphs. Math. Progr. 40, 197–204 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  3. Hoffman, A.J.: On greedy algorithms that succeed. In: Anderson, I. (ed.) Surveys in Combinatorics, pp. 97–112. Cambridge Univ. Press, Cambridge (1985)

    Google Scholar 

  4. Hoffman, A.J., Kolen, A.W.J., Sakarovitch, M.: Totally balanced and greedy matrices. SIAM Journal Alg. Discr. Methods 6, 721–730 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  5. Faigle, U., Hoffman, A.J., Kern, W.: A characterization of non-negative greedy matrices. SIAM Journal on Discrete Mathematics 9, 1–6 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Frank, A.: Increasing the rooted connectivity of a digraph by one. Math. Programming 84, 565–576 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Faigle, U., Peis, B.: Two-phase greedy algorithm for some classes of combinatorial linear programs. In: SODA 2008 Proceedings (2008)

    Google Scholar 

  8. Faigle, U., Kern, W., Peis, B.: A Ranking Model for Cooperative Games, Convexity and the Greedy Algorithm. To appear in Math. Programming, Ser. A (2010)

    Google Scholar 

  9. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian J. Math. 8, 399–404 (1956)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gröflin, H., Hoffman, A.j.: Lattice polyhedra II: generalizations, constructions and examples. Annals of Discrete Mathematics 15, 189–203 (1982)

    MATH  MathSciNet  Google Scholar 

  11. Gaillard, A., Groeflin, H., Hoffman, A.J., Pulleyblank, W.R.: On the submodular matrix representation of a digraph. Theoretical Computer Science 287, 563–570 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  13. Weihe, K.: Maximum (s,t)-flows in planar networks in O(|V| log|V|) time. JCSS 55, 454–476 (1997)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math. Institut, Universität zu Köln, Weyertal 80, D-50931, Köln, Germany

    Ulrich Faigle

  2. Universiteit Twente, P.O. Box 217, NL-7500, AE, Enschede, Netherlands

    Walter Kern

  3. Technische Universität Berlin, Straße des 17. Juni 135, D-10623, Berlin, Germany

    Britta Peis

Authors
  1. Ulrich Faigle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Kern
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Britta Peis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Systemics "Antonio Ruberti", Sapienza University of Rome, Via Ariosto 25, 00185, Rome, Italy

    Alberto Marchetti-Spaccamela

  2. Communication Systems Engineering Department, Ben-Gurion University of the Negev, POB 653, 84105, Beer-Sheva, Israel

    Michael Segal

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Faigle, U., Kern, W., Peis, B. (2011). On Greedy and Submodular Matrices. In: Marchetti-Spaccamela, A., Segal, M. (eds) Theory and Practice of Algorithms in (Computer) Systems. TAPAS 2011. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19754-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19754-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19753-6

  • Online ISBN: 978-3-642-19754-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation