7930 search results - page 191 / 1586 » Greedy in Approximation Algorithms |
133
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...
164
click to vote
IAT
2006
IEEE
16 years 15 days ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
153
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
182
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
180
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...