Optimal Embedding into Star Metrics (Q3183463): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03367-4_26
+Normal rank
@@ Property / OpenAlex ID @@
+W2153523737
@@ Property / OpenAlex ID: W2153523737 / rank @@
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a minimum-dilation spanning tree is NP-hard
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+Normal rank
@@ Property / cites work @@
+Metric spaces in pure and applied mathematics
@@ Property / cites work: Metric spaces in pure and applied mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4532026
@@ Property / cites work: Q4532026 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete
+Normal rank
@@ Property / cites work @@
+Q4945509
@@ Property / cites work: Q4945509 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum dilation stars
@@ Property / cites work: Minimum dilation stars / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3895490
@@ Property / cites work: Q3895490 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of the minimum cycle mean in a digraph
+Normal rank
@@ Property / cites work @@
+Parametric shortest path algorithms with an application to cyclic staffing
+Normal rank
@@ Property / cites work @@
+Computing Geometric Minimum-Dilation Graphs Is NP-Hard
+Normal rank
@@ Property / cites work @@
+Q4549227
@@ Property / cites work: Q4549227 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization with rational objective functions
+Normal rank
@@ Property / cites work @@
+Applying Parallel Computation Algorithms in the Design of Serial Algorithms
+Normal rank
@@ Property / cites work @@
+Towards a Genuinely Polynomial Algorithm for Linear Programming
+Normal rank