676 search results - page 71 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
151
click to vote
FOCS
2006
IEEE
16 years 7 days ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
152
click to vote
ICRA
2008
IEEE
16 years 18 days ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...
136
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
173
click to vote
COMPGEOM
2009
ACM
16 years 21 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
198
click to vote
SIGECOM
2009
ACM
16 years 21 days ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...