暂无分享,去创建一个
[1] Shirley Dex,et al. JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .
[2] Erin W. Chambers,et al. Minimum cuts and shortest homologous cycles , 2009, SCG '09.
[3] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[4] Erin W. Chambers,et al. Splitting (complicated) surfaces is hard , 2006, SCG '06.
[5] R. Ho. Algebraic Topology , 2022 .
[6] E. Felten,et al. A Crystalline Approximation Theorem for Hypersurfaces , 1990 .
[7] Klaus Truemper,et al. A decomposition theory for matroids. VII. Analysis of minimal violation matrices , 1992, J. Comb. Theory, Ser. B.
[8] Herbert Edelsbrunner,et al. Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[9] James R. Munkres,et al. Elements of algebraic topology , 1984 .
[10] Chao Chen,et al. Hardness Results for Homology Localization , 2010, SODA.
[11] de VerdièreÉric Colin,et al. Tightening Nonsimple Paths and Cycles on Surfaces , 2010 .
[12] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[13] Paul D. Seymour,et al. Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.
[14] Kees Roos,et al. Degeneracy in interior point methods for linear programming: a survey , 1993, Ann. Oper. Res..
[15] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..
[16] Jeff Erickson,et al. Greedy optimal homotopy and homology generators , 2005, SODA '05.
[17] Éva Tardos,et al. A strongly polynomial minimum cost circulation algorithm , 1985, Comb..
[18] K. TRUEMPER. A Decomposition Theory for Matroids , 2003 .
[19] H. P. Williams. THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .
[20] Jeff Erickson,et al. Tightening non-simple paths and cycles on surfaces , 2006, SODA '06.
[21] Chao Chen,et al. Measuring and computing natural generators for homology groups , 2010, Comput. Geom..
[22] G. Dantzig,et al. Integral Extreme Points , 1968 .
[23] David Cohen-Steiner,et al. Computing geometry-aware handle and tunnel loops in 3D models , 2008, ACM Trans. Graph..
[24] Alireza Tahbaz-Salehi,et al. Distributed Coverage Verification in Sensor Networks Without Location Information , 2010, IEEE Transactions on Automatic Control.
[25] I. Heller,et al. 14 . An Extension of a Theorem of Dantzig’s , 1957 .
[26] Vin de Silva,et al. HOMOLOGICAL SENSOR NETWORKS , 2005 .
[27] H. Smith. I. On systems of linear indeterminate equations and congruences , 1862, Proceedings of the Royal Society of London.
[28] Tamal K. Dey,et al. Approximating loops in a shortest homology basis from point data , 2010, SoCG '10.