A branch-and-cut approach for minimum weight triangulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1350, Issue , 1997, Pages 384-393

  Kyoda, Yoshiaki ^a   Imai, Keiko ^b   Takeuchi, Fumihiko ^a   Tajima, Akira ^c  

^a UNIVERSITY OF TOKYO   (Japan)

^b CHUO UNIVERSITY   (Japan)

^c IBM RESEARCH TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL GEOMETRY; MATHEMATICAL PROGRAMMING; OPTIMIZATION; SURVEYING; TRIANGULATION;

BRANCH AND CUT; COMPUTATIONAL EXPERIMENT; GEOMETRIC PROPERTIES; INDEPENDENT SET PROBLEMS; INTERSECTION GRAPH; MAXIMAL INDEPENDENT SET; MINIMUM WEIGHT; MINIMUM WEIGHT TRIANGULATION;

INTEGER PROGRAMMING;

EID: 84896999511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_41     Document Type: Conference Paper

References (15)

1. D. Applegate, R. Bixby, V. Chvatal and B. Cook. Finding Cuts in the TSP (A preliminary report). Technical Reports 95-05, DIMACS, 1995.
2. M. Berkelaar. lp_solve. Available at ftp://ftp.es.ele.tue.nl/pub/lp_solve
3. M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In "Computing in Euclidean Geometry" (2nd edition), Lecture Notes Series on Computing, Vol.4, World Scientific, 1995, pp.47-123.
4. th Canadian Conference of Computational Geometry, 1995, pp.279-284.
5. S.-W. Cheng, N. Katoh and M. Sugai. A study of the LMT-skeleton. Proc. 7th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol.1178, pp.256-265.
6. S.-W. Cheng and Y.-F. Xu. Approaching the largest /3-Skeleton within a minimum weight triangulation. Proc. 12th Annual ACM Symposium on Computational Geometry, 1996, pp.196--203.
7. M. T. Dickerson and M. H. Montague. A (usually?) connected subgraph of the min- imum weight triangulation. Proc. 12th Annual ACM Symposium on Computational Geometry, 1996, pp.204-213.
8. H. Edelsbrunner and T. S. Tan. A quadratic time algorithm for the minmax length triangulation. SIAM J. Comput., 22:527-551, 1993.
9. J. M. Keil. Computing a subgraph of the minimum weight triangulation. Computational Geometry Theory and Applications, 4:13-26, 1994.
10. Y. Kyoda. A study of generating minimum weight triangulation within practical time. Master's Thesis, Department of Information Science, University of Tokyo, March 1996. Available at http: //naomi.is.s.u-tokyo.ac.jp/
11. C. Levcopoulos and D. Krznaric. Quasigreedy triangulations approximating the minimum weight triangulation. Proc. 7th Annual A CM-SIAM Symposium on Dis- crete Algorithms, 1996, pp.392-401.
12. T. Masada, H. Imai and K. Imai. Enumeration of regular triangulations. Proc. 12th Annual ACM Symposium on Computational Geometry, 1996, pp.224-233.
13. G. L. Nemhauser and L. E. Trotter. Vertex packings: structural properties and algorithms. Mathematical Programming, 8, 2:232-248, 1975.
14. F. Takeuchi and H. Imai. Enumerating triangulations for products of two simplices and for arbitrary configurations of points. Proc. 3rd International Computing and Combinatorics Computing Conference, Lecture Notes in Computer Science, 1997.
15. C. A. Wang, F. Chin and Y.-F. Xu. A new subgraph of minimum weight triangulation. Proc. 7th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol.1178, pp.266-274