676 search results - page 47 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
139
click to vote
NIPS
2008
15 years 3 months ago
2008
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
119
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
135
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
132
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
133
click to vote
MST
2011
14 years 9 months ago
2011
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...