676 search results - page 9 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
TSP
2008
14 years 11 months ago
2008
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
103
Voted
TSP
2008
14 years 11 months ago
2008
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
97
Voted
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— This paper presents an analysis of target localization accuracy, attainable by the use of MIMO (MultipleInput Multiple-Output) radar systems, configured with multiple ...
131
click to vote
ESA
2003
Springer
15 years 4 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...