676 search results - page 31 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
118
click to vote
WAOA
2007
Springer
15 years 8 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
111
click to vote
AIPS
2007
15 years 4 months ago
2007
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
142
click to vote
AAAI
2010
15 years 3 months ago
2010
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
110
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
137
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...