|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
31st Annual Symposium on Foundations of Computer Science (FOCS 1990)
St. Louis, MO, USA
October 22-October 24
ISBN: 0-8186-2082-X
| ASCII Text | x | ||
| P. Klein, A. Agrawal, R. Ravi, S. Rao, "Approximation through multicommodity flow," Foundations of Computer Science, IEEE Annual Symposium on, pp. 726-737 vol.2, 31st Annual Symposium on Foundations of Computer Science (FOCS 1990), 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/FSCS.1990.89595, author = {P. Klein and A. Agrawal and R. Ravi and S. Rao}, title = {Approximation through multicommodity flow}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1990}, isbn = {0-8186-2082-X}, pages = {726-737 vol.2}, doi = {http://doi.ieeecomputersociety.org/10.1109/FSCS.1990.89595}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Approximation through multicommodity flow SN - 0-8186-2082-X SP726 EP737 vol.2 A1 - P. Klein, A1 - A. Agrawal, A1 - R. Ravi, A1 - S. Rao, PY - 1990 KW - minimum deletion KW - multicommodity flow KW - max-flow-min-cut theorem KW - approximation algorithms VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
The first approximate max-flow-min-cut theorem for general multicommodity flow is proved. It is used to obtain approximation algorithms for minimum deletion of clauses of a 2-CNF identical to formula, via minimization problems, and other problems. Also presented are approximation algorithms for chordalization of a graph and for register sufficiency that are based on undirected and directed node separators.
Index Terms:
minimum deletion, multicommodity flow, max-flow-min-cut theorem, approximation algorithms
Citation:
P. Klein, A. Agrawal, R. Ravi, S. Rao, "Approximation through multicommodity flow," focs, pp.726-737 vol.2, 31st Annual Symposium on Foundations of Computer Science (FOCS 1990), 1990
Usage of this product signifies your acceptance of the Terms of Use.