676 search results - page 26 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
100
click to vote
ICALP
2009
Springer
16 years 1 days ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
ECCC
2010
14 years 11 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
146
click to vote
STOC
2007
ACM
16 years 1 days ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
107
Voted
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...