\(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension (Q2084642): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-021-00792-4
+Normal rank
@@ Property / OpenAlex ID @@
+W3082674212
@@ Property / OpenAlex ID: W3082674212 / 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 @@
+Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
+Normal rank
@@ Property / cites work @@
+Hierarchy of Transportation Network Parameters and Hardness Results
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
+Normal rank
@@ Property / cites work @@
+The parameterized hardness of the \(k\)-center problem in transportation networks
+Normal rank
@@ Property / cites work @@
+Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons
+Normal rank
@@ Property / cites work @@
+On the computational complexity of centers locating in a graph
+Normal rank