Sciweavers

2796 search results - page 6 / 560
» The coolest path problem
Sort
View
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
15 years 6 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
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...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
WIOPT
2006
IEEE
15 years 3 months ago
A structural property of solutions to path optimization problems in random access networks
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...
Arzad Alam Kherani, Dinesh Kumar 0002, Eitan Altma...
FOCS
2005
IEEE
15 years 3 months ago
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
Jon M. Kleinberg
STACS
2010
Springer
15 years 4 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 6 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac