133 search results - page 6 / 27 » Approximation bounds for Black Hole Search problems |
141
click to vote
WDAG
2007
Springer
16 years 1 days ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
189
click to vote
HEURISTICS
1998
15 years 5 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
146
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
169
click to vote
SIGECOM
2008
ACM
15 years 5 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
171
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...