Approximating Directed Multicuts
- 期刊名称Combinatorica
- 作者Joseph Cheriyan*; Howard Karloff; Yuval Rabani†
- 卷第25卷
- 期第3期
- 印刷ISSN0209-9683
- 电子ISSN1439-6912
- 文件大小292.60KB
- 发表时间2005-05
- DOI10.1007/s00493-005-0015-5
- 页码251-269
On Infinite Cycles IIReinhard Diestel; Daniela Kühn · Combinatorica · 2004
Graph minor hierarchiesReinhard Diestel; Daniela Kühn · 2005
Graph-theoretical versus topological ends of graphsReinhard Diestel; Daniela Kühn · 2003
Topological paths, cycles and spanning trees in infinite graphsReinhard Diestel; Daniela Kühn · 2004
Diametric theorems in sequence spacesR. Ahlswede; N. Cai; Z. Zhang · Combinatorica · 1992
Small transversals in hypergraphsV. Chvátal; C. McDiarmid · Combinatorica · 1992
On integer points in polyhedraW. Cook; M. Hartmann; R. Kannan; C. McDiarmid · Combinatorica · 1992
Spanning trees of extended graphsA. K. Kelmans · Combinatorica · 1992
On rank vs. communication complexityNoam Nisan; Avi Wigderson · Combinatorica · 1995
Colouring a graph frugallyHugh Hind; Michael Molloy; Bruce Reed · Combinatorica · 1997
Expanding graphs and invariant meansYehuda Shalom · Combinatorica · 1997
Universally signable graphsMichele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković · Combinatorica · 1997