Optimal homologous cycles, total unimodularity, and linear programming

SIAM Journal on Computing

Volumn 40, Issue 4, 2011, Pages 1026-1044

  Dey, Tamal K ^a   Hirani, Anil N ^b   Krishnamoorthy, Bala ^c  

^a The Ohio State University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Computational topology; Homology localization; Optimal chain; Simplicial complex

Indexed keywords

COMPUTATIONAL TOPOLOGY; HOMOLOGY LOCALIZATIONS; INTEGER PROGRAMMING PROBLEMS; INTEGER SOLUTIONS; LINEAR PROGRAMS; MATRIX; NP-HARD; OPTIMAL CHAINS; OPTIMIZATION APPROACH; OPTIMIZATION PROBLEMS; ORIENTABLE; POLYNOMIAL-TIME; SIMPLICIAL COMPLEX; SUBCOMPLEXES; TOTAL UNIMODULARITY; UNIMODULAR;

LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; TOPOLOGY;

INTEGER PROGRAMMING;

EID: 80053183452     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/100800245     Document Type: Article

References (24)

1. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, Belmont, MA, 1997.
2. E. W. Chambers, É. Colin de Verdière, J. Erickson, F. Lazarus, and K. Whittlesey, Splitting (complicated) surfaces is hard, Comput. Geom., 41 (2008), pp. 94-110.
3. E. W. Chambers, J. Erickson, and A. Nayyeri, Minimum cuts and shortest homologous cycles, in Proceedings of the 25th Annual Symposium on Comput. Geom., 2009, pp. 377-385.
4. C. Chen and D. Freedman, Hardness results for homology localization, in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, 2010, pp. 1594-1604.
5. C. Chen and D. Freedman, Measuring and computing natural generators for homology groups, Comput. Geom., 43 (2010), pp. 169-181.
6. É. Colin de Verdière and J. Erickson, Tightening non-simple paths and cycles on surfaces, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 192-201.
7. V. de Silva and R. Ghrist, Homological sensor networks, Notices Amer. Math. Soc., 54 (2007), pp. 10-17.
8. T. K. Dey, K. Li, J. Sun, and D. Cohen-Steiner, Computing geometry-aware handle and tunnel loops in 3d models, in SIGGRAPH '08: ACM SIGGRAPH 2008 papers, 2008, pp. 1-9.
9. T. K. Dey, J. Sun, and Y. Wang, Approximating loops in a shortest homology basis from point data, in Proceedings of the 26th Annual Symposium on Comput. Geom., 2010, pp. 166-175.
10. H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological persistence and simplification, Discrete Comput. Geom., 28 (2002), pp. 511-533.
11. J. Erickson and K. Whittlesey, Greedy optimal homotopy and homology generators, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 1038-1046.
12. O. Güler, D. den Hertog, C. Roos, T. Terlaky, and T. Tsuchiya, Degeneracy in interior point methods for linear programming: A survey, Ann. Oper. Res., 46-47 (1993), pp. 107-138.
13. I. Heller and C. B. Tompkins, An extension of a theorem of Dantzig's, in Linear Inequalities and Related Systems, Ann. of Math. Stud. 38, H. W. Kuhn and A. W. Tucker, eds., Princeton University Press, Princeton, NJ, 1956, pp. 247-254.
14. J. R. Munkres, Elements of Algebraic Topology, Addison-Wesley, Menlo Park, CA, 1984.
15. A. Schrijver, Theory of Linear and Integer Programming, Wiley-Interscience Series in Discrete Mathematics, John Wiley, Chichester, 1986.
16. P. D. Seymour, Decomposition of regular matroids, J. Combin. Theory Ser. B, 28 (1980), pp. 305-359.
17. H. J. S. Smith, On systems of linear indeterminate equations and congruences, Philos. Trans. R. Soc. Lond., 151 (1861), pp. 293-326.
18. E. H. Spanier, Algebraic Topology, McGraw-Hill, New York, 1966.
19. J. M. Sullivan, A Crystalline Approximation Theorem for Hypersurfaces, Ph.D. thesis, Princeton University, NJ, 1990.
20. A. Tahbaz-Salehi and A. Jadbabaie, Distributed coverage verification algorithms in sensor networks without location information, IEEE Trans. Automat. Control, 55 (2010), pp. 1837-1849.
21. E. Tardos, A strongly polynomial minimum cost circulation algorithm, Combinatorica, 5 (1985), pp. 247-255.
22. E. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs, Oper. Res., 34 (1986), pp. 250-256.
23. K. Truemper, A decomposition theory for matroids. VII. Analysis of minimal violation matrices, J. Combin. Theory Ser. B, 55 (1992), pp. 302-335.
24. A. F. Veinott, Jr. and G. B. Dantzig, Integral extreme points, SIAM Rev., 10 (1968), pp. 371-372.