A Branch-and-Cut Approach for Minimum Weight Triangulation

Authors:
Yoshiaki Kyoda;Keiko Imai;Fumihiko Takeuchi;Akira Tajima
Affiliations:
-;-;-;-
Venue:
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Year:
1997

Optimality and Integer Programming Formulations of Triangulations in General Dimension

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Minimum weight triangulation is NP-hard

Proceedings of the twenty-second annual symposium on Computational geometry
The minimum weight triangulation problem with few inner points

Computational Geometry: Theory and Applications
Minimum-weight triangulation is NP-hard

Journal of the ACM (JACM)
The minimum weight triangulation problem with few inner points

Computational Geometry: Theory and Applications
A fixed-parameter algorithm for the minimum weight triangulation problem based on small graph separators

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On a linear program for minimum-weight triangulation

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Hi-index	0.00