144 search results - page 10 / 29 » Improved Approximation Algorithms for Metric Max TSP |
CCE
2004
13 years 7 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
TSP
2010
13 years 2 months ago
2010
We propose an adaptive technique to design the spectrum of an orthogonal frequency division multiplexing (OFDM) waveform to improve the radar's wideband ambiguity function (WA...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...