A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem

DOI10.1007/11589440_9MaRDI QIDQ5449757zbMATH OpenOpenAlexFDO

Authors Magdalene Grantson, Christos Levcopoulos

Publication date 18 March 2008

Published in Discrete and Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11589440_9

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A fixed parameter algorithm for optimal convex partitions
• Approximation Algorithms for the Minimum Convex Partition Problem
• A Convex Approach to Minimal Partitions
• Solving the minimum convex partition of point sets with integer programming
• Minimization and parameterized variants of vertex partition problems on graphs
• Tight Time Bounds for the Minimum Local Convex Partition Problem
• Min-Max partitioning problem with matroid constraint
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Efficient convex optimization for minimal partition problems with volume constraints
• A partitioning algorithm for the mixed integer nonlinear programming problem

Cited in

(6)

• A fixed parameter algorithm for optimal convex partitions
• Conical partition algorithm for maximizing the sum of dc ratios
• A Convex Approach to Minimal Partitions
• An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem
• Tight Time Bounds for the Minimum Local Convex Partition Problem
• Convex partitions with 2-edge connected dual graphs

This page was built for publication: A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449757)