Approximation Algorithms for the Minimum Convex Partition Problem
From MaRDI portal
Recommendations
Cited in
(33)- A fixed parameter algorithm for optimal convex partitions
- A simplified convergence proof for the cone partitioning algorithm
- Covering points with convex sets of minimum size
- Conical partition algorithm for maximizing the sum of dc ratios
- Least-cost partition algorithms
- Approximation algorithms for the partial assignment problem
- Approximating a planar convex set using a sparse grid
- Minimum perimeter-sum partitions in the plane
- Minimum convex partition of point sets
- Geometric partitioning and robust ad-hoc network design
- scientific article; zbMATH DE number 6381654 (Why is no real title available?)
- Minimum convex partitions and maximum empty polytopes
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Better Approximations for the Minimum Common Integer Partition Problem
- Computing optimal islands
- An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
- scientific article; zbMATH DE number 1830733 (Why is no real title available?)
- scientific article; zbMATH DE number 1877049 (Why is no real title available?)
- A Convex Approach to Minimal Partitions
- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach
- Partitioning strategies for the block Cimmino algorithm
- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
- Tight Time Bounds for the Minimum Local Convex Partition Problem
- Minimum weight convex Steiner partitions
- Minimum convex partition of a constrained point set
- Computing low-cost convex partitions for planar point sets based on tailored decompositions (CG challenge)
- Minimization and parameterized variants of vertex partition problems on graphs
- Convex partitions with 2-edge connected dual graphs
- Hardness and approximation of minimum convex partition
- An integer programming formulation using convex polygons for the convex partition problem
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
- Solving the minimum convex partition of point sets with integer programming
- Decomposing a simple polygon into pseudo-triangles and convex polygons
This page was built for publication: Approximation Algorithms for the Minimum Convex Partition Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757909)
