Obtaining approximately optimal and diverse solutions via dispersion
From MaRDI portal
Publication:6109008
DOI10.1007/978-3-031-20624-5_14arXiv2202.10028OpenAlexW4312724701MaRDI QIDQ6109008
Hao-Tsung Yang, Mayank Goswami, Jie Gao, C. S. Karthik, Meng-Tsung Tsai, Shih-Yu Tsai
Publication date: 26 July 2023
Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.10028
shortest pathdispersion problemmaximum matchingtravelling salesman problemminimum spanning treediversity
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- The discrete p-dispersion problem
- Matching is as easy as matrix inversion
- A study on two geometric location problems
- A bicriterion shortest path algorithm
- Approximation algorithms for maximum dispersion
- One-exact approximate Pareto sets
- An improved deterministic parameterized algorithm for cactus vertex deletion
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- The wireless network jamming problem
- Multicriteria global minimum cuts
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Max-sum diversity via convex programming
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
- Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
- Random pseudo-polynomial algorithms for exact matroid problems
- Two Algorithms for Generating Weighted Spanning Trees in Order
- Heuristic and Special Case Algorithms for Dispersion Problems
- Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
- Local Search for Max-Sum Diversification
- The constrained minimum spanning tree problem
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Diverse near neighbor problem
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Hardness Amplification of Optimization Problems
- Diverse Pairs of Matchings
- Obtaining approximately optimal and diverse solutions via dispersion
This page was built for publication: Obtaining approximately optimal and diverse solutions via dispersion
