4843 search results - page 112 / 969 » The Shortcut Problem - Complexity and Approximation |
128
click to vote
SODA
2010
ACM
16 years 12 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
130
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
145
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
142
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
124
click to vote
WASA
2009
Springer
15 years 9 months ago
2009
Springer
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...