Exponential approximation schemata for some network design problems (Q396669): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2013.06.011
@@ Property / DOI: 10.1016/j.jda.2013.06.011 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B10
@@ Property / Mathematics Subject Classification ID: 90B10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6329907
@@ Property / zbMATH DE Number: 6329907 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+exponential algorithms
@@ Property / zbMATH Keywords: exponential algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Steiner tree
@@ Property / zbMATH Keywords: Steiner tree / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+traveling salesman problem
@@ Property / zbMATH Keywords: traveling salesman problem / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2013.06.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2079928809
@@ Property / OpenAlex ID: W2079928809 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner problem with edge lengths 1 and 2
@@ Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for exact satisfiability and number of perfect matchings
+Normal rank
@@ Property / cites work @@
+Narrow sieves for parameterized paths and packings
+Normal rank
@@ Property / cites work @@
+Efficient approximation of Min Set Cover by moderately exponential algorithms
+Normal rank
@@ Property / cites work @@
+Approximation of min coloring by moderately exponential algorithms
+Normal rank
@@ Property / cites work @@
+Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
+Normal rank
@@ Property / cites work @@
+An improved LP-based approximation for steiner tree
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
+Normal rank
@@ Property / cites work @@
+Exponential-time approximation of weighted set cover
+Normal rank
@@ Property / cites work @@
+Exact and approximate bandwidth
@@ Property / cites work: Exact and approximate bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Approximation Problems
@@ Property / cites work: Parameterized Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized approximation of dominating set problems
+Normal rank
@@ Property / cites work @@
+Faster Steiner Tree Computation in Polynomial-Space
+Normal rank
@@ Property / cites work @@
+An Exponential Time 2-Approximation Algorithm for Bandwidth
+Normal rank
@@ Property / cites work @@
+Expected Computation Time for Hamiltonian Path problem
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
+Normal rank
@@ Property / cites work @@
+Deterministic 7/8-Approximation for the Metric Maximum TSP
+Normal rank
@@ Property / cites work @@
+Saving space by algebraization
@@ Property / cites work: Saving space by algebraization / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for the Steiner Tree Problem
@@ Property / cites work: A Faster Algorithm for the Steiner Tree Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
+Normal rank
@@ Property / cites work @@
+Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
+Normal rank
@@ Property / cites work @@
+A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2013.06.011
@@ Property / DOI: 10.1016/J.JDA.2013.06.011 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:396669