316 search results - page 23 / 64 » Approximation algorithms for hierarchical location problems |
140
click to vote
COMGEO
2008
ACM
15 years 1 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
126
click to vote
ECCV
2000
Springer
15 years 6 months ago
2000
Springer
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
176
Voted
APPROX
2006
Springer
15 years 5 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
135
click to vote
TRANSCI
2010
15 years 7 days ago
2010
To design a transportation sensor network, the decision-maker needs to determine what sensor investments should be made, as well as when, how, where and with what technologies. Th...
124
Voted
TCS
2010
15 years 7 days ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...