676 search results - page 67 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
166
click to vote
DAM
2008
15 years 6 months ago
2008
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
132
click to vote
JC
2007
15 years 6 months ago
2007
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup f...
187
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
168
click to vote
APPROX
2009
Springer
16 years 23 days ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
160
click to vote
MOR
2008
15 years 6 months ago
2008
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...