676 search results - page 46 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
150
click to vote
WIOPT
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
119
click to vote
TIT
1998
15 years 1 months ago
1998
—A sequential decoder for linear block codes that performs maximum-likelihood soft-decision decoding is described. The decoder uses a metric computed from a lower bound on the co...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
129
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
ALGORITHMICA
2004
15 years 1 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...