4894 search results - page 165 / 979 » The Guarding Problem - Complexity and Approximation |
163
click to vote
ICDT
2007
ACM
15 years 10 months ago
2007
ACM
Abstract. We introduce approximate data exchange, by relaxing classical data exchange problems such as Consistency and Typechecking to their approximate versions based on Property ...
192
click to vote
FOCS
2008
IEEE
15 years 7 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...
194
click to vote
CORR
2010
Springer
15 years 6 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,
157
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
173
click to vote
ALGORITHMICA
2005
15 years 6 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...