402 search results - page 2 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
COMPGEOM
2009
ACM
14 years 9 days ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
DAC
2011
ACM
12 years 5 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
IPL
2011
13 years 22 days ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
SODA
2010
ACM
14 years 3 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...
FOCS
2006
IEEE
13 years 12 months ago
2006
IEEE