7006 search results - page 42 / 1402 » Approximation Algorithms |
IPL
2011
13 years 3 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...
CIAC
2006
Springer
14 years 6 days ago
2006
Springer
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...