Network Optimization
- 26 July 2013
- book chapter
- Published by Springer Nature
- p. 1989-2026
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A Faster Algorithm for Finding the Minimum Cut in a Directed GraphJournal of Algorithms, 1994
- Algorithms for drawing graphs: an annotated bibliographyComputational Geometry, 1994
- On sparse spanners of weighted graphsDiscrete & Computational Geometry, 1993
- Provably good performance-driven global routingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Linear Programming1991
- Finding minimum-cost circulations by canceling negative cyclesJournal of the ACM, 1989
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Optimal Sequencing of Two Equivalent ProcessorsSIAM Journal on Applied Mathematics, 1969