676 search results - page 54 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
173
click to vote
ACSC
2005
IEEE
15 years 11 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
177
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
132
click to vote
SPIRE
2001
Springer
15 years 10 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
168
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
137
click to vote
JDA
2006
15 years 6 months ago
2006
Traditionally, on-line problems have been studied under the assumption that there is a unique sequence of requests that must be served. This approach is common to most general mod...