181 search results - page 3 / 37 » Improved Approximation Algorithm for Convex Recoloring of Tr... |
STOC
2000
ACM
13 years 9 months ago
2000
ACM
FOCS
2009
IEEE
14 years 3 days ago
2009
IEEE
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
IPCO
2010
13 years 3 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...