Sciweavers

144 search results - page 27 / 29
» Improved Approximation Algorithms for Metric Max TSP
Sort
View
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 8 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
VLDB
2007
ACM
131views Database» more  VLDB 2007»
14 years 7 months ago
Dissemination of compressed historical information in sensor networks
Sensor nodes are small devices that "measure" their environment and communicate feeds of low-level data values to a base station for further processing and archiving. Dis...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
ICALP
2007
Springer
14 years 1 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
ALGORITHMICA
2011
13 years 2 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal