The minimum Manhattan network problem: Approximations and exact solutions (Q2432734): Difference between revisions

@@ 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.comgeo.2005.09.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2161943311
@@ Property / OpenAlex ID: W2161943311 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234097
@@ Property / cites work: Q4234097 / rank @@
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graph
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q4945509
@@ Property / cites work: Q4945509 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2748154
@@ Property / cites work: Q2748154 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4427856
@@ Property / cites work: Q4427856 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952700
@@ Property / cites work: Q4952700 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum Manhattan network problem: Approximations and exact solutions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2432734