676 search results - page 34 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
172
click to vote
ALT
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
160
click to vote
JCSS
2008
15 years 6 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
135
click to vote
ICML
2003
IEEE
16 years 6 months ago
2003
IEEE
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
198
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
151
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...