51 search results - page 2 / 11 » Approximating (r, p)-Centroid on a Path |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
ESA
2008
Springer
13 years 7 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...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
SODA
1998
ACM
13 years 6 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
SEMWEB
2007
Springer
13 years 11 months ago
2007
Springer
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...