Iterative Packing for Demand and Hypergraph Matching
Author:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 349-361
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- On k-Column Sparse Packing ProgramsLecture Notes in Computer Science, 2010
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer ProgramsLecture Notes in Computer Science, 2009
- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality2009
- On the complexity of approximating k-set packingcomputational complexity, 2006
- Scheduling Split IntervalsSIAM Journal on Computing, 2006
- Greedy Approximation via Duality for Packing, Combinatorial Auctions and RoutingLecture Notes in Computer Science, 2005
- Approximating disjoint-path problems using packing integer programsMathematical Programming, 2004
- Randomized metaroundingRandom Structures & Algorithms, 2002
- A Factor 2 Approximation Algorithm for the Generalized Steiner Network ProblemCombinatorica, 2001
- On the fractional matching polytope of a hypergraphCombinatorica, 1993