4843 search results - page 158 / 969 » The Shortcut Problem - Complexity and Approximation |
152
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
150
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
114
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
127
click to vote
ALGORITHMICA
2005
15 years 3 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
109
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We improve on random sampling techniques for approximately solving problems that involve cuts and flows in graphs. We give a near-linear-time construction that transforms any grap...