11 search results - page 1 / 3 » Integer and fractional packings of hypergraphs |
58
Voted
JCT
2007
15 years 9 days ago
2007
182
Voted
DC
2011
14 years 7 days ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
126
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
124
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...