On the face lattice of the metric polytope

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

Volumn 2866, Issue , 2003, Pages 118-128

  Deza, Antoine ^a   Fukuda, Komei ^b   Mizutani, Tomohiko ^c   Vo, Cong ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b MCGILL UNIVERSITY   (Canada)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL GEOMETRY; QUANTUM THEORY; TOPOLOGY;

CODIMENSION-3; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL ISSUES; ENUMERATION ALGORITHMS; ENUMERATION PROBLEMS; HIGH-DIMENSIONAL; SYMMETRY GROUPS; VERTEX ENUMERATION;

OPTIMIZATION;

EID: 35248834727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44400-8_12     Document Type: Article

References (17)

1. D. Avis: Irs homepage, School of Computer Science, McGill University, Canada (2001) http://www.cgm.cs.mcgill.ca/∼avis/C/lrs.html
2. D. Avis, D. Bremner, R. Seidel: How good are convex hull algorithms? Computational Geometry: Theory and Applications 7 (1997) 265-301
3. D. Avis, K. Fukuda, S. Picozzi: On canonical representations of convex polyhedra. In: A.M. Cohen, X.S. Gao, N. Tokuyama (eds.): Mathematical Software, World Scientific (2002) 351-360
4. T. Christof, G. Reinelt: Decomposition and parallelization techniques for enumerating the facets of combinatorial polytopes. International Journal of Computational Geometry and Applications 11-4 (2001) 423-437
5. A. Deza: Metric polytope homepage, Math. and Comput. Sci. Dept., Tokyo Institute of Technology, Japan (2002) http://www.is.titech.ac.jp/∼deza/ metric.html
6. A. Deza, M. Deza: The ridge graph of the metric polytope and some relatives. In: T. Bisztriczky, P. McMullen, R. Schneider, A.I. Weiss (eds.): Polytopes: Abstract, Convex and Computational (1994) 359-372
7. A. Deza, M. Deza: The combinatorial structure of small cut and metric polytopes. In: T.H. Ku (eds.): Combinatorics and Graph Theory, World Scientific (1995) 70-88
8. A. Deza, M. Deza, K. Fukuda: On skeletons, diameters and volumes of metric polyhedra. In: M. Deza, R. Euler, Y. Manoussakis (eds.): Lecture Notes in Computer Science 1120 Springer-Verlag, Berlin Heidelberg New York (1996) 112-128
9. A. Deza, K. Fukuda, D. Pasechnik, M. Sato: On the skeleton of the metric polytope. In: J. Akiyama, M. Kano, M. Urabe (eds.): Lecture Notes in Computer Science 2098 Springer-Verlag, Berlin Heidelberg New York (2001) 125-136
10. A. Deza, B. Goldengorin, D. Pasechnik: e-print math.MG/0306049 at arXiv.org (2003) http://arXiv.org/abs/math.MG/0306049
11. M. Deza, V. Grishukhin, M. Laurent: The symmetries of the cut polytope and of some relatives. In: P. Gritzmann, B. Sturmfels (eds.): Applied Geometry and Discrete Mathematics, the "Victor Klee Festschrift" DIMACS Series in Discrete Mathematics and Theoretical Computer Science 4 (1991) 205-220
12. M. Deza, M. Laurent: Geometry of cuts and metrics. Algorithms and Combinatorics 15 Springer-Verlag, Berlin Heidelberg New York (1997)
13. K. Fukuda: cddlib reference manual, cddlib Version 0.92, ETHZ, Zürich, Switzerland (2001) http://www.ifor.math.ethz.ch/∼fukuda/ cdd_home/cdd.html
14. K. Fukuda, V. Rosta: Combinatorial face enumeration in convex polytopes. Computational Geometry: Theory and Applications 4 (1994) 191-198
15. M. Laurent: Graphic vertices of the metric polytope. Discrete Mathematics 151 (1996) 131-153
16. M. Laurent, S. Poljak: The metric polytope. In: E. Balas, G. Cornuejols, R. Kannan (eds.): Integer Programming and Combinatorial Optimization (1992) 247-286
17. S. Poljak, Z. Tuza: Maximum cuts and large bipartite subgraphs. In: W. Cook, L. Lovasz, P. Seymour (eds.): DIMACS Series 20 (1995) 181-244