676 search results - page 133 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
CIC
2004
13 years 8 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
BMCBI
2010
13 years 7 months ago
2010
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
CC
2007
Springer
13 years 7 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
PRL
2008
13 years 7 months ago
2008
Pattern classification techniques derived from statistical principles have been widely studied and have proven powerful in addressing practical classification problems. In real-wo...