Compact location problems (Q1391322): Difference between revisions

@@ Property / author @@
-Sven O. Krumke
@@ Property / author: Sven O. Krumke / rank @@
-Normal rank
@@ Property / author @@
-Madhav V. Marathe
@@ Property / author: Madhav V. Marathe / rank @@
-Normal rank
@@ Property / author @@
-Hartmut Noltemeier
@@ Property / author: Hartmut Noltemeier / rank @@
-Normal rank
@@ Property / author @@
-Venkatesh Radhakrishnan
@@ Property / author: Venkatesh Radhakrishnan / rank @@
-Normal rank
@@ Property / author @@
+Sven O. Krumke
@@ Property / author: Sven O. Krumke / rank @@
+Normal rank
@@ Property / author @@
+Madhav V. Marathe
@@ Property / author: Madhav V. Marathe / rank @@
+Normal rank
@@ Property / author @@
+Hartmut Noltemeier
@@ Property / author: Hartmut Noltemeier / rank @@
+Normal rank
@@ Property / author @@
+Venkatesh Radhakrishnan
@@ Property / author: Venkatesh Radhakrishnan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Finding k points with minimum diameter and related problems
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5674437
@@ Property / cites work: Q5674437 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234074
@@ Property / cites work: Q4234074 / rank @@
+Normal rank
@@ Property / cites work @@
+How to Allocate Network Centers
@@ Property / cites work: How to Allocate Network Centers / rank @@
+Normal rank
@@ Property / cites work @@
+Improved non-approximability results
@@ Property / cites work: Improved non-approximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234076
@@ Property / cites work: Q4234076 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Static and dynamic algorithms for k-point clustering problems
+Normal rank
@@ Property / cites work @@
+A simple heuristic for the p-centre problem
@@ Property / cites work: A simple heuristic for the p-centre problem / rank @@
+Normal rank
@@ Property / cites work @@
+Iterated nearest neighbors and finding minimal polytopes
+Normal rank
@@ Property / cites work @@
+Analytical models for locating undesirable facilities
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(log <i>k</i>) approximation algorithm for the <i>k</i> minimum spanning tree problem in the plane
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+Q3316922
@@ Property / cites work: Q3316922 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4359752
@@ Property / cites work: Q4359752 / rank @@
+Normal rank
@@ Property / cites work @@
+On k-Nearest Neighbor Voronoi Diagrams in the Plane
+Normal rank
@@ Property / cites work @@
+Bicriteria Network Design Problems
@@ Property / cites work: Bicriteria Network Design Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Applying Parallel Computation Algorithms in the Design of Serial Algorithms
+Normal rank
@@ Property / cites work @@
+Q3993417
@@ Property / cites work: Q3993417 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Spanning Trees—Short or Small
@@ Property / cites work: Spanning Trees—Short or Small / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Obnoxious Facility Location on Graphs
@@ Property / cites work: Obnoxious Facility Location on Graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1391322