Disjoint bases in a polymatroid
- 11 June 2009
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 35 (4) , 418-430
Abstract
No abstract availableKeywords
Funding Information
- NSF (CCF-0515088, CCF-0728782)
This publication has 14 references indexed in Scilit:
- Packing element-disjoint steiner treesACM Transactions on Algorithms, 2007
- A new multilayered PCP and the hardness of hypergraph vertex cover2003
- Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε2002
- Randomized metaroundingRandom Structures & Algorithms, 2002
- Approximating theDomatic NumberSIAM Journal on Computing, 2002
- Min-Wise Independent PermutationsJournal of Computer and System Sciences, 2000
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Geometric Algorithms and Combinatorial Optimization1988
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- On a combinatorial problem. IIActa Mathematica Hungarica, 1964