Approximation Algorithms for Steiner and Directed Multicuts
- 28 February 1997
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 22 (2), 241-269
- https://doi.org/10.1006/jagm.1996.0833
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Network synchronization with polylogarithmic overheadPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improved bounds on the max-flow min-cut ratio for multicommodity flowsCombinatorica, 1995
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applicationsCombinatorica, 1995
- Approximating minimum feedback sets and multi-cuts in directed graphsLecture Notes in Computer Science, 1995
- Approximate max-flow min-(multi)cut theorems and their applicationsPublished by Association for Computing Machinery (ACM) ,1993
- Improved routing strategies with succinct tablesJournal of Algorithms, 1990
- A trade-off between space and efficiency for routing tablesJournal of the ACM, 1989
- Network decomposition and locality in distributed computationPublished 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
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974