Skip to main content
SpringerLink
Log in

On greedy algorithms for series parallel graphs

  • Published:
Mathematical Programming Submit manuscript

Abstract

This note describes some sufficient conditions for the maximum or minimum of a weighted flow (the weights are on paths, and are derived from weights on the edges of the path), of given volume in a series parallel graph to be found by a greedy algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Y.P. Aneja, R. Chandrasekaran and K.P.K. Nair, “Classes of linear programs with integral optimal solutions,”Mathematical Programming Study 24 (1985) 225–237.

    Google Scholar 

  2. W.W. Bein, P. Brucker and A. Tamir, “Minimum cost flow algorithms for series-parallel networks,”Discrete Applied Mathematics 10 (1985) 117–124.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, IBM Thomas J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, NY, USA

    Alan J. Hoffman

Authors
  1. Alan J. Hoffman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hoffman, A.J. On greedy algorithms for series parallel graphs. Mathematical Programming 40, 197–204 (1988). https://doi.org/10.1007/BF01580730

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation