Results 1  10
of
699
Approximating the Metric TSP in linear time
 In Proceedings of WG
, 2008
"... Given a metric graph G = (V, E) of n vertices, i.e., a complete graph with an edge cost function c: V × V ↦ → R≥0 satisfying the triangle inequality, the metricity degree c(x,y) ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a metric graph G = (V, E) of n vertices, i.e., a complete graph with an edge cost function c: V × V ↦ → R≥0 satisfying the triangle inequality, the metricity degree c(x,y)
EightFifth Approximation for TSP Paths
, 2012
"... We prove the approximation ratio 8/5 for the metric {s, t}pathTSP problem, and more generally for shortest connected Tjoins. The algorithm that achieves this ratio is the simple “Best of Many ” version of Christofides’ algorithm (1976), suggested by An, Kleinberg and Shmoys (2012), which consists ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We prove the approximation ratio 8/5 for the metric {s, t}pathTSP problem, and more generally for shortest connected Tjoins. The algorithm that achieves this ratio is the simple “Best of Many ” version of Christofides’ algorithm (1976), suggested by An, Kleinberg and Shmoys (2012), which
Improved Approximations for TSP with Simple Precedence Constraints
 in "CIAC 2010", Italie, Lecture Notes in Computer Science
"... Abstract. In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides ’ algorithm and Hoogeveen’s algorithm by relating the two underlying problems, i. e., the traveling salesman problem and the problem of ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
subset of vertices has to be visited in some prescribed linear order. For the metric case, we present an algorithm that guarantees an approximation ratio of 2.5 − 2/k, where k is the number of ordered vertices. For nearmetric input instances satisfying a βrelaxed triangle inequality, we improve
A lineartime approximation scheme for TSP in undirected planar graphs with edgeweights
, 2009
"... We give an algorithm requiring O(c1/ǫ2n) time to find an ǫoptimal traveling salesman tour in the shortestpath metric defined by an undirected planar graph with nonnegative edgelengths. For the case of all lengths equal to 1, the time required is O(c 1/ǫ n). ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We give an algorithm requiring O(c1/ǫ2n) time to find an ǫoptimal traveling salesman tour in the shortestpath metric defined by an undirected planar graph with nonnegative edgelengths. For the case of all lengths equal to 1, the time required is O(c 1/ǫ n).
An improved integrality gap for asymmetric TSP paths
 In Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization
, 2013
"... The Asymmetric Traveling Salesperson Path (ATSPP) problem is one where, given an asymmetric metric space (V,d) with specified vertices s and t, the goal is to find an st path of minimum length that passes through all the vertices in V. This problem is closely related to the Asymmetric TSP (ATSP) pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The Asymmetric Traveling Salesperson Path (ATSPP) problem is one where, given an asymmetric metric space (V,d) with specified vertices s and t, the goal is to find an st path of minimum length that passes through all the vertices in V. This problem is closely related to the Asymmetric TSP (ATSP
Buffer Overflow Asymptotics For A Buffer Handling Many Traffic Sources
 Journal of Applied Probability
, 1995
"... As a model for an ATM switch we consider the overflow frequency of a queue that is served at a constant rate and in which the arrival process is the superposition of N traffic streams. We consider an asymptotic as N !1 in which the service rate Nc and buffer size Nb also increase linearly in N . In ..."
Abstract

Cited by 78 (0 self)
 Add to MetaCart
. In this regime, the frequency of buffer overflow is approximately exp(\GammaN I(c; b)), where I(c; b) is given by the solution to an optimization problem posed in terms of timedependent logarithmic moment generating functions. Experimental results for Gaussian and Markov modulated fluid source models show
Searching dynamic point sets in spaces with bounded doubling dimension
 In The thirtyeighth annual ACM symposium on Theory of computing (STOC
, 2006
"... We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data structure has linear size and supports insertions and deletions in O(log n) time, and finds a (1 + ɛ)approximate neares ..."
Abstract

Cited by 41 (14 self)
 Add to MetaCart
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data structure has linear size and supports insertions and deletions in O(log n) time, and finds a (1 + ɛ)approximate
Finding Similar Regions In Many Strings
 Journal of Computer and System Sciences
, 1999
"... Algorithms for finding similar, or highly conserved, regions in a group of sequences are at the core of many molecular biology problems. We solve three main open questions in this area. Assume that we are given n DNA sequences s1 ; : : : ; sn . The Consensus Patterns problem, which has been widely ..."
Abstract

Cited by 69 (9 self)
 Add to MetaCart
] give efficient approximation algorithms using linear program ralaxation techniques. The best polynomial time approximation has ratio 4 3 for all d, given by [18] ([9] also independently claimed the 4 3 ratio but only for superlogarithmic d). We settle the problem with a PTAS. We then give the first
On the ChoiceBased Linear Programming Model for Network Revenue Management
, 2004
"... Gallego et. al [22] recently proposed a customerchoicebased LP model for network revenue management (RM) which parallels the widelyused deterministic linear programming model. While they focused on analyzing “flexible products ” a situation in which the provider has the flexibility of using a co ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
Gallego et. al [22] recently proposed a customerchoicebased LP model for network revenue management (RM) which parallels the widelyused deterministic linear programming model. While they focused on analyzing “flexible products ” a situation in which the provider has the flexibility of using a
Inapproximability for metric embeddings into R d
, 2008
"... We consider the problem of computing the smallest possible distortion for embedding of a given npoint metric space into R d, where d is fixed (and small). For d = 1, it was known that approximating the minimum distortion with a factor better than roughly n 1/12 is NPhard. From this result we deriv ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We consider the problem of computing the smallest possible distortion for embedding of a given npoint metric space into R d, where d is fixed (and small). For d = 1, it was known that approximating the minimum distortion with a factor better than roughly n 1/12 is NPhard. From this result we
Results 1  10
of
699