Computing diverse and nice triangulations
From MaRDI portal
Cites work
- A Quadratic Time Algorithm for the Minmax Length Triangulation
- A quasi-polynomial time approximation scheme for minimum weight triangulation
- An improved analysis of local search for max-sum diversification
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
- Computational geometry. Algorithms and applications.
- Computing MaxMin edge length triangulations
- Constructing concise convex covers via clique covers (CG challenge)
- Diverse Pairs of Matchings
- Diverse partitions of colored points
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Finding diverse minimum s-t cuts
- Flip distance between triangulations of a simple polygon is NP-complete
- Generating triangulations at random
- Happy endings for flip graphs
- Heuristic and Special Case Algorithms for Dispersion Problems
- scientific article; zbMATH DE number 3633698 (Why is no real title available?)
- Improved approximation algorithms and lower bounds for search-diversification problems
- Max-sum diversification, monotone submodular functions, and dynamic updates
- Minimum-weight triangulation is NP-hard
- Obtaining approximately optimal and diverse solutions via dispersion
- On fully diverse sets of geometric objects and graphs
- On the Angle Condition in the Finite Element Method
- On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- The diameter of associahedra
- The discrete p-dispersion problem
- The dispersive art gallery problem
- Triangulations. Structures for algorithms and applications
This page was built for publication: Computing diverse and nice triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852227)
