Approximating minimum feedback sets and multi-cuts in directed graphs
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Approximate max-flow min-(multi)cut theorems and their applicationsPublished by Association for Computing Machinery (ACM) ,1993
- A parallel approximation algorithm for positive linear programmingPublished by Association for Computing Machinery (ACM) ,1993
- Retiming synchronous circuitryAlgorithmica, 1991
- An analytical approach to the partial scan problemJournal of Electronic Testing, 1990
- Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacitiesPublished by Association for Computing Machinery (ACM) ,1990
- BALLAST: a methodology for partial scan designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Multi-Commodity Network FlowsOperations Research, 1963