2957 search results - page 87 / 592 » The Complexity of Polynomial-Time Approximation |
127
click to vote
WINE
2005
Springer
15 years 8 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
124
click to vote
DCG
2010
15 years 3 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
137
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
121
click to vote
NETWORKS
2007
15 years 2 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
114
click to vote
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...