Approximation algorithms for maximum dispersion
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- A class of bounded approximation algorithms for graph partitioning
- An Analysis of the Greedy Heuristic for Independence Systems
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Computational aspects of the maximum diversity problem
- Facility dispersion and remote subgraphs
- Greedily finding a dense subgraph
- Heuristic and Special Case Algorithms for Dispersion Problems
- Obnoxious Facility Location on Graphs
- Time bounds for selection
Cited in
(43)- Truthful Mechanisms for Matching and Clustering in an Ordinal World
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- Finding connected \(k\)-subgraphs with high density
- Maximum dispersion problem in dense graphs
- Iterated tabu search for the maximum diversity problem
- scientific article; zbMATH DE number 7561387 (Why is no real title available?)
- Min sum clustering with penalties
- Improved approximation algorithms for cycle and path packings
- An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
- Dispersing and grouping points on planar segments
- A deterministic approximation algorithm for metric triangle packing
- Diversity and freshness-aware regret minimizing set queries
- An improved approximation algorithm for metric triangle packing
- Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
- Approximating the maximum quadratic assignment problem
- Measuring diversity. A review and an empirical analysis
- Finding Connected Dense $$k$$-Subgraphs
- Complexity of finding dense subgraphs
- Away from each other
- scientific article; zbMATH DE number 1670536 (Why is no real title available?)
- An improved analysis of local search for max-sum diversification
- Approximation algorithms for graph approximation problems
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
- Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
- Two dimensional maximum weight matching using Manhattan topology
- The densest \(k\)-subgraph problem on clique graphs
- The equitable dispersion problem
- Computational geometric aspects of rhythm, melody, and voice-leading
- Heuristic solution approaches for the maximum minsum dispersion problem
- Solving Generalized Maximum Dispersion with Linear Programming
- Max-min dispersion on a line
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- Exact algorithms for the max-min dispersion problem
- Maximization problems of balancing submodular relevance and supermodular diversity
- Towards strong regret minimization sets: balancing freshness and diversity in data selection
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
- The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- A hybrid metaheuristic method for the maximum diversity problem
- Obtaining approximately optimal and diverse solutions via dispersion
This page was built for publication: Approximation algorithms for maximum dispersion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375119)
