Faster approximation algorithms for generalized flow

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Faster approximation algorithms for generalized flow

Full text

Pdf (250 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland, United States

Pages: 981 - 982

Year of Publication: 1999

ISBN:0-89871-434-6

Authors

Kevin D. Wayne	Computer Science Department, Princeton University, Princeton, NJ
Lisa Fleischer	IndustriaI Engineering and Operations Research, Columbia University, New York, NY

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 21, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. Charnes and W. M. Raike. One-pass algor/thms for some generalized network flow problems. #t/or# Rese#rc# 14:914--924, 1966.
	2	Naveen Garg , Jochen Koenemann, Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems., Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.300, November 08-11, 1998
	3	Andrew V. Goldberg , Serge A. Plotkin , Éva Tardos, Combinatorial algorithms for the generalized circulation problem, Mathematics of Operations Research, v.16 n.2, p.351-381, May 1991 [doi>10.1287/moor.16.2.351]
	4	Jeffrey D. Oldham, Combinatorial approximation algorithms for generalized flow problems, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.704-714, January 17-19, 1999, Baltimore, Maryland, United States
	5	T. Radzik. Approximate generalized circulation. CCOP Technical Report 93-2, Cornell University, 1993.
	6	Terri L. Griffith , Mark A. Fuller , Gregory B. Northcraft , Tomasz Radzik, Faster Algorithms for the Generalized Network Flow Problem, Mathematics of Operations Research, v.23 n.1, p.69-100, January 1998 [doi>10.1287/moor.23.1.69]
	7	Éva Tardos , Kevin D. Wayne, Simple Generalized Maximum Flow Algorithms, Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization, p.310-324, June 22-24, 1998

CITED BY 6

	George Karakostas, Faster approximation schemes for fractional multicommodity flow problems, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.166-173, January 06-08, 2002, San Francisco, California
	Jeffrey D. Oldham, Combinatorial approximation algorithms for generalized flow problems, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.704-714, January 17-19, 1999, Baltimore, Maryland, United States
	Kevin D. Wayne, A polynomial combinatorial algorithm for generalized minimum cost flow, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.11-18, May 01-04, 1999, Atlanta, Georgia, United States
	Jiang Hu , Sachin S. Sapatnekar, A timing-constrained algorithm for simultaneous global routing of multiple nets, Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, November 05-09, 2000, San Jose, California
	Rajagopal Iyengar, Combinatorial approaches to QoS scheduling in multichannel infrastructure wireless networks, Proceedings of the 2nd annual international workshop on Wireless internet, p.10-es, August 02-05, 2006, Boston, Massachusetts
	Eric Wong , Jacob Minz , Sung Kyu Lim, Decoupling capacitor planning and sizing for noise and leakage reduction, Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design, November 05-09, 2006, San Jose, California