The Parameterized Hardness of the k-Center Problem in Transportation Networks (Q5116483): Difference between revisions

@@ label / en / label / en @@
+The Parameterized Hardness of the k-Center Problem in Transportation Networks
@@ Property / DOI @@
-.4230/LIPIcs.SWAT.2018.19
@@ Property / DOI: 10.4230/LIPIcs.SWAT.2018.19 / rank @@
-Normal rank
@@ Property / cites work @@
+Highway Dimension and Provably Efficient Shortest Path Algorithms
+Normal rank
@@ Property / cites work @@
+VC-Dimension and Shortest Path Algorithms
@@ Property / cites work: VC-Dimension and Shortest Path Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417667
@@ Property / cites work: Q5417667 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and approximation algorithms for clustering
@@ Property / cites work: Exact and approximation algorithms for clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q3574266
@@ Property / cites work: Q3574266 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating <i>k</i>-center in planar graphs
@@ Property / cites work: Approximating <i>k</i>-center in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
+Normal rank
@@ Property / cites work @@
+Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
+Normal rank
@@ Property / cites work @@
+Q5136270
@@ Property / cites work: Q5136270 / rank @@
+Normal rank
@@ Property / cites work @@
+Lossy kernelization
@@ Property / cites work: Lossy kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
+Normal rank
@@ Property / cites work @@
+On the computational complexity of centers locating in a graph
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2018/8845/pdf/LIPIcs-SWAT-2018-19.pdf
+Normal rank
@@ Property / OpenAlex ID @@
+W2963629213
@@ Property / OpenAlex ID: W2963629213 / rank @@
+Normal rank
@@ Property / title @@
+The Parameterized Hardness of the k-Center Problem in Transportation Networks (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.SWAT.2018.19
@@ Property / DOI: 10.4230/LIPICS.SWAT.2018.19 / rank @@
+Normal rank