Disjoint bases in a polymatroid
From MaRDI portal
Publication:3055784
DOI10.1002/rsa.20274zbMath1205.05039OpenAlexW3083181187MaRDI QIDQ3055784
Gruia Călinescu, Jan Vondrák, Chandra Chekuri
Publication date: 9 November 2010
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20274
Related Items (2)
Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
Cites Work
- Unnamed Item
- Low discrepancy sets yield approximate min-wise independent permutation families
- Min-wise independent permutations
- An analysis of the greedy algorithm for the submodular set covering problem
- A Small Approximately Min-Wise Independent Family of Hash Functions
- A threshold of ln n for approximating set cover
- Approximating the domatic number
- Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε
- A new multilayered PCP and the hardness of hypergraph vertex cover
- An analysis of approximations for maximizing submodular set functions—I
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Lehmans switching game and a theorem of Tutte and Nash-Williams
This page was built for publication: Disjoint bases in a polymatroid
