Approximation algorithms for maximum dispersion (Q1375119): Difference between revisions

@@ Property / cites work @@
+Greedily finding a dense subgraph
@@ Property / cites work: Greedily finding a dense subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Time bounds for selection
@@ Property / cites work: Time bounds for selection / rank @@
+Normal rank
@@ Property / cites work @@
+Facility dispersion and remote subgraphs
@@ Property / cites work: Facility dispersion and remote subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A class of bounded approximation algorithms for graph partitioning
+Normal rank
@@ Property / cites work @@
+An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational aspects of the maximum diversity problem
+Normal rank
@@ Property / cites work @@
+An Analysis of the Greedy Heuristic for Independence Systems
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Obnoxious Facility Location on Graphs
@@ Property / cites work: Obnoxious Facility Location on Graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(97)00034-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1990605847
@@ Property / OpenAlex ID: W1990605847 / rank @@
+Normal rank