Skip to main content
SpringerLink
Log in

Network Optimization

  • Reference work entry
  • First Online:
Handbook of Combinatorial Optimization

  • 7287 Accesses

Abstract

Many real-life problems can be modeled as optimization problems in networks. Examples include finding shortest paths, scheduling classes in classrooms, and finding the vulnerability of networks to disconnection because of link and node failures. In this chapter, a number of interesting problems and their algorithms are surveyed. Some of the problems studied are matching, weighted matching, maximum flow in networks, blocking flows, minimum cuts, densest subgraphs, minimum-cost flows, multi-commodity flows, minimum spanning trees, spanners, Light approximate shortest path trees, and graph coloring. Some interesting applications of matching, namely, two processor scheduling, edge covers, and the Chinese postman problem, are also discussed.

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 3,400.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network flows (Prentice Hall, Englewood Cliffs, 1993)

    MATH  Google Scholar 

  2. I. Althöfer, G. Das, D. Dobkin, D. Joseph, J. Soares, On sparse spanners of weighted graphs. Discret. Comput. Geom. 9(1), 81–100 (1993)

    Article  MATH  Google Scholar 

  3. B. Awerbuch, T. Leighton, A simple local-control approximation algorithm for multicommodity flow, in Proceedings of the 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, 3–5 November 1993, pp. 459–468

    Google Scholar 

  4. B. Awerbuch, T. Leighton, Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, in Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, Montréal, 23–25 May 1994, pp. 487–496

    Google Scholar 

  5. B. Awerbuch, A. Baratz, D. Peleg, Cost-sensitive analysis of communication protocols, in Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, Quebec City, 22–24 Aug 1990, pp. 177–187

    Google Scholar 

  6. B. Awerbuch, A. Baratz, D. Peleg, Efficient broadcast and light-weight spanners. Manuscript (1991)

    Google Scholar 

  7. G.D. Battista, P. Eades, R. Tamassia, I.G. Tollis, Annotated bibliography on graph drawing algorithms. Comput. Geom. 4, 235–282 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  8. B. Bollobás, Extremal Graph Theory (Academic, New York, 1978)

    MATH  Google Scholar 

  9. B. Chandra, G. Das, G. Narasimhan, J. Soares, New sparseness results on graph spanners, in Proceedings of the 8th Annual ACM Symposium on Computational Geometry (ACM, Berlin, Germany, 1992), pp. 192–201

    Google Scholar 

  10. J. Cong, A.B. Kahng, G. Robins, M. Sarrafzadeh, C.K. Wong. Provably good performance-driven global routing. IEEE Trans. CAD 11(6), 739–752 (1992)

    Article  Google Scholar 

  11. T.H. Cormen, C.E. Leiserson, C. Stein, R.L. Rivest, Introduction to Algorithms (MIT, Cambridge, 1989)

    Google Scholar 

  12. D.S. Hochbaum (ed.) Approximation Algorithms for NP-Hard Problems (PWS Publishing, Boston, 1996)

    MATH  Google Scholar 

  13. J. Edmonds, E.L. Johnson, Matching, Euler tours and the Chinese postman. Math. Program. 5, 88–124 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  14. J. Edmonds, R.M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. Comput. Mach. 19, 248–264 (1972)

    Article  MATH  Google Scholar 

  15. S. Even, Graph Algorithms (Computer Science Press, Rockville, 1979)

    MATH  Google Scholar 

  16. L.R. Ford, D.R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, 1962)

    MATH  Google Scholar 

  17. M. Fujii, T. Kasami, K. Ninomiya, Optimal sequencing of two equivalent processors. SIAM J. Appl. Math. 17(4), 784–789 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  18. H.N. Gabow, Z. Galil, T. Spencer, R.E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109–122 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  19. M.R. Garey, D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness (Freeman, San Francisco, 1979)

    MATH  Google Scholar 

  20. A.M. Gibbons, Algorithmic Graph Theory (Cambridge University Press, New York, 1985)

    MATH  Google Scholar 

  21. A. Goldberg, S. Rao, Beyond the flow decomposition barrier, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Miami Beach, Florida, 20–22 October 1997, pp. 2–11

    Google Scholar 

  22. A.V. Goldberg, R.E. Tarjan, Finding minimum-cost circulations by canceling negative cycles. J. Assoc. Comput. Mach. 36(4), 873–886 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  23. A.V. Goldberg, É. Tardos, R.E. Tarjan, Network flow algorithms, in Algorithms and Combinatorics Volume 9: Flows, Paths and VLSI Layout, ed. by B. Korte, L. Lovász, H. J. Prömel, A. Schrijver (Springer, Berlin, 1990), pp. 101–164

    Google Scholar 

  24. J. Hao, J.B. Orlin, A faster algorithm for finding the minimum cut in a directed graph. J. Algorithm. 17(3), 424–446 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  25. F. Hwang, D.S. Richards, P. Winter, The Steiner Tree Problem (North-Holland, Amsterdam, 1992)

    MATH  Google Scholar 

  26. D. Karger, R. Motwani, M. Sudan, Approximate graph coloring by semidefinite programming, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science Santa Fe, New Mexico, 20–22 November 1994, pp. 2–13

    Google Scholar 

  27. D.R. Karger, Minimum cuts in near-linear time, in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, 22–24 May 1996, pp. 56–63

    Google Scholar 

  28. H. Karloff, Linear Programming (Birkhäuser, Boston, 1991)

    Book  MATH  Google Scholar 

  29. S. Khuller, B. Raghavachari, N. Young, Balancing minimum spanning trees and shortest-path trees. Algorithmica 14(4), 305–321 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  30. J. Kleinberg, É. Tardos, Algorithm Design (Pearson Education, Boston, 2006)

    Google Scholar 

  31. J.M. Kleinberg, Single-source unsplittable flow, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington, Vermont, 14–16 October 1996, pp. 68–77

    Google Scholar 

  32. L-C. Lau, R. Ravi, M. Singh, Iterative Methods in Combinatorial Optimization (Cambridge University Press, Cambridge, 2011)

    Book  MATH  Google Scholar 

  33. E. L. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)

    MATH  Google Scholar 

  34. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985)

    MATH  Google Scholar 

  35. L. Lovász, M.D. Plummer, Matching Theory (Elsevier, New York, 1986)

    MATH  Google Scholar 

  36. S. Micali, V.V. Vazirani, An \(O(\sqrt{\vert V \vert }\cdot \vert E\vert )\) algorithm for finding maximum matching in general graphs, in Proceedings of the 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, 13–15 October 1980, pp. 17–27

    Google Scholar 

  37. H. Nagamochi, T. Ibaraki, Computing edge-connectivity in multi-graphs and capacitated graphs. SIAM J. Disc. Math. 5(1), 54–66, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  38. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity (Prentice Hall, Englewood Cliffs, 1982)

    MATH  Google Scholar 

  39. D. Peleg, A. Schäffer, Graph spanners. J. Graph Theory 13, 99–116 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  40. B. Saha, A. Hoch, S. Khuller, L. Raschid, X-N. Zhang, Dense subgraphs with restrictions and applications to gene annotation graphs, in RECOMB, ed. by B. Berger. Volume 6044 of Lecture Notes in Computer Science (Springer, Berlin, 2010)

    Google Scholar 

  41. M. Stoer, F. Wagner, A simple min-cut algorithm. J. Assoc. Comput. Mach., 44(4), 585–590 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  42. É. Tardos, A strongly polynomial minimum cost circulation algorithm. Combinatorica 5, 247–255 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  43. R.E. Tarjan, Data and Network Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, 1983)

    Book  Google Scholar 

  44. V.V. Vazirani, Approximation Algorithms (Springer, Berlin, 2001)

    Google Scholar 

  45. D.P. Williamson, D.S. Shmoys, Design of Approximation Algorithms (Cambridge University Press, New York, 2011)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, A.V. Williams Bldg., Room 3369, 20742, College Park, MD, USA

    Samir Khuller

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Balaji Raghavachari

Authors
  1. Samir Khuller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Balaji Raghavachari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Samir Khuller or Balaji Raghavachari .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Eng, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  2. Department of Computer Science, University of Texas, Dallas, Richardson, Texas, USA

    Ding-Zhu Du

  3. Dept. Comp. Sci. & Engineering, University of California, San Diego, La Jolla, California, USA

    Ronald L. Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this entry

Cite this entry

Khuller, S., Raghavachari, B. (2013). Network Optimization. In: Pardalos, P., Du, DZ., Graham, R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-7997-1_10

Download citation

Publish with us

Policies and ethics

Search

Navigation