Searching for "On the Efficiency of Polynomial Time Approximation Schemes" – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
On the Efficiency of Polynomial Time Approximation Schemes
- …On the Efficiency of Polynomial Time Approximation Schemes Marco Cesati Luca Trevisan y…
- Cited by 21 (0 self) – Add To MetaCart
-
On the efficiency of polynomial time approximation schemes
- …@(email omitted); with subject 'help eccc' On the Efficiency of Polynomial Time Approximation Schemes Marco Cesati Luca…
- Add To MetaCart
-
The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes
- … The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes M. Hauptmann…
- Add To MetaCart
-
An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Using
- …An ecient polynomial time approximation scheme for the constrained minimum spanning tree problem…
- Cited by 5 (0 self) – Add To MetaCart
-
On Approximation Hardness of the Bandwidth Problem
- … on approximation hardness of this problem. In this paper we show, that there are no efficient polynomial time…
- Cited by 3 (1 self) – Add To MetaCart
-
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
- …, Ottmann and Widmayer [5]. There, we devised efficient polynomial time approximation schemes for a number…
- Cited by 8 (0 self) – Add To MetaCart
-
W -hardness under linear FPTreductions: structural properties and further applications
- … polynomial of 1/ɛ and |x|, and is an efficient polynomial time approximation scheme for Q [3] if the running…
- Cited by 1 (1 self) – Add To MetaCart
-
Parameterized intractability of distinguishing substring selection
- …) by Deng et al. [6, 7] cannot be replaced by a so-called efficient polynomial-time approximation scheme…
- Cited by 2 (1 self) – Add To MetaCart
-
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- … negative result --- Second Hamiltonian Cycle admits a polynomial-time approximating scheme, 2 where a…
- Cited by 6 (0 self) – Add To MetaCart
-
Experimental evaluation of a tree decomposition based algorithm for vertex cover on planar graphs
- …’s Work on Approximation Algorithms. In her influential work [7], Baker gave efficient polynomial time…
- Cited by 11 (6 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
