Homology flows, cohomology cuts

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 273-281

  Chambers, Erin W ^a   Erickson, Jeff ^b   Nayyeri, Amir ^b  

^a SAINT LOUIS UNIVERSITY   (United States)

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

Author keywords

Combinatorial optimization; Computational topology

Indexed keywords

COHOMOLOGY; COMPUTATIONAL TOPOLOGY; COST CYCLES; EMBEDDED GRAPHS; MAXIMUM FLOWS; NEAR-LINEAR TIME; ORIENTABLE SURFACES; PLANAR GRAPH; SPARSE GRAPHS; TIME ALGORITHMS; TIME BOUND; UNDIRECTED GRAPH;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; TOPOLOGY;

COMPUTATION THEORY;

EID: 70350672583     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536453     Document Type: Conference Paper

References (77)

1. R. Agarwala and D. Fernández-Baca. Weighted multidimensional search and its application to convex optimization. SIAM J. Comput. 25:83-99, 1996.
2. P. K. Agarwal and M. Sharir. Efficient algorithms for geometric optimization. ACM Comput. Surv. 30:412-458, 1998.
3. P. K. Agarwal, M. Sharir, and S. Toledo. An efficient multidimensional searching technique and its applications. Tech. Rep. CS-1993-20, Dept. Comp. Sci., Duke Univ., August 1993. hftp://ftp.cs.duke.edu/pub/dist/techreport/1993/ 1993-20.ps.gzi.
4. R. K. Ahuja, T. L. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
5. L. Aleksandrov and H. Djidjev. Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Discrete Math 9(1):129-150, 1996.
6. Y. P. Aneja and S. N. Kabadi. Polynomial algorithms for Lagrangean relaxations in combinatorial problems. Faculty of Business Working Paper Series W91-03, University of Windsor, 1991. Cited in [52].
7. T. C. Biedl, B. Brejová, and T. Vina?r. Simplifying flow networks. Proc. 25th Symp. Math. Found. Comput. Sci., 192-201, 2000. Lecture Notes Comput. Sci. 1893, Springer-Verlag.
8. G. Borradaile. Exploiting Planarity for Network Flow and Connectivity Problems. Ph.D. thesis, Brown University, May 2008. hhttp://www.cs.brown. edu/research/pubs/theses/phd/2008/glencora.pdf.
9. G. Borradaile, E. D. Demaine, and S. Tazari. Polynomialtime approximation schemes for subset-connectivity problems in bounded-genus graphs. Proc. 26th Int. Symp. Theoretical Aspects Comput. Sci., 171-182, 2009. Dagstuhl Seminar Proceedings. hhttp://drops.dagstuhl.de/opus/volltexte/2009/1835/.
10. G. Borradaile, C. Kenyon-Mathieu, and P. N. Klein. A polynomial-time approximation scheme for Steiner tree in planar graphs. Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms, 1285-1294, 2007.
11. G. Borradaile, C. Kenyon-Mathieu, and P. N. Klein. Steiner tree in planar graphs: An O(n log n) approximation scheme with singly-exponential dependence on epsilon. Proc. 10th Ann. Workshop on Algorithms and Data Structures, 275-286, 2007.
12. G. Borradaile and P. Klein. An O(n log n)-time algorithm for maximum st-flow in a directed planar graph. Proc. 17th Ann. ACM-SIAM Symp. Discrete Algorithms, 524-533, 2006.
13. G. Borradaile and P. Klein. An O(n log n) algorithm for maximum st-flow in a directed planar graph. J. ACM, to appear, 2009. hhttp://www.math. uwaterloo.ca/̃glencora/downloads/maxflow-full.pdf.
14. S. Cabello and E. W. Chambers. Multiple source shortest paths in a genus g graph. Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms, 89-97, 2007.
15. E. W. Chambers, É. Colin de Verdière, J. Erickson, F. Lazarus, and K. Whittlesey. Splitting (complicated) surfaces is hard. Comput. Geom. Theory Appl. 41(1-2):94-110, 2008.
16. E. W. Chambers, J. Erickson, and A. Nayyeri. Minimum cuts and shortest homologous cycles. Proc. 25th Ann. ACM Symp. Comput. Geom., 2009. hhttp://www.cs.uiuc.edu/̃jeffe/pubs/surfcut.html.
17. E. Cohen. Combinatorial Algorithms for Optimization Problems. Ph.D. thesis, Dept. Comput. Sci., Stanford Univ., June 1991. Tech. Report STAN-CS-91-1366.
18. E. Cohen and N. Megiddo. Maximizing concave functions in fixed dimension. Complexity in Numerical Optimization, 74-87, 1993. World Scientific.
19. E. Cohen and N. Megiddo. Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. J. Assoc. Comput. Mach. 40(4):791-830, 1993.
20. E. Cohen and N. Megiddo. Algorithms and complexity analysis for some flow problems. Algorithmica 11(3):320-340, 1994.
21. E. D. Demaine, M. Hajiaghayi, and B. Mohar. Approximation algorithms via contraction decomposition. Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms, 278-287, 2007.
22. S. I. Diatch and D. A. Spielman. Faster lossy generalized flow via interior point algorithms. Proc. 40th ACM Symp. Theory Comput., 451-460, 2008.
23. H. N. Djidjev and S. M. Venkatesan. Planarization of graphs embedded on surfaces. Proc. 21st Workshop Graph-Theoretic Concepts Comput. Sci., 62-72, 1995. Lecture Notes Comput. Sci. 1017, Springer-Verlag.
24. D. Eppstein. Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms and Applications 3(3):1-27, 1999.
25. D. Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica 27:275-291, 2000.
26. D. Eppstein. Dynamic generators of topologically embedded graphs. Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms, 599-608, 2003.
27. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete Comput. Geom. 31(1):37-59, 2004.
28. J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms, 1038-1046, 2005.
29. J. Fakcharoenphol and S. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5):868-889, 2006.
30. L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian J. Math. 8(399-404), 1956.
31. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs with applications. SIAM J. Comput. 16(6):1004-1004, 1987.
32. J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan. A separator theorem for graphs of bounded genus. J. Algorithms 5(3):391-407, 1984.
33. A. V. Goldberg and S. Rao. Beyond the flow decomposition barrier. J. ACM 45(5):783-797, 1998.
34. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. Assoc. Comput. Mach. 35(4):921-940, 1988.
35. M. Grohe. Isomorphism testing for embeddable graphs through definability. Proc. 32nd ACM Symp. Theory Comput., 63-72, 2000.
36. J. L. Gross and T. W. Tucker. Topological graph theory. Dover Publications, 2001.
37. M. Gr̈tschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2):169-197, 1981.
38. M. Gr̈tschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, 2nd edition. Algorithms and Combinatorics 2. Springer-Verlag, 1993.
39. T. E. Harris and F. S. Ross. Fundamentals of a method for evaluating rail net capacities. Tech. rep., The RAND Corporation, Santa Monica, California, October 24 1955. Cited in [70].
40. R. Hassin. Maximum flow in (s, t) planar networks. Inform. Proc. Lett. 13:107, 1981.
41. 2 n) algorithm for maximum flow in undirected planar networks. SIAM J. Comput. 14(3):612-624, 1985.
42. A. Hatcher. Algebraic Topology. Cambridge University Press, 2001. hhttp://www.math.cornell.edu/̃hatcher/.
43. M. R. Henzinger, P. Klein, S. Rao, and S. Subramanian. Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55(1):3-23, 1997.
44. 3n log n) time. Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms, 843-847, 2007.
45. J. E. Hopcroft and J. K. Wong. Linear time algorithm for isomorphism of planar graphs (preliminary report). Proc. 6th ACM Symp. Theory Comput., 172-184, 1974.
46. J. P. Hutchinson. On genus-reducing and planarizing algorithms for embedded graphs. Graphs and Algorithms, Proc. AMS-IMS-SIAM Joint Summer Res. Conf., 19-26, 1989. Contemporary Mathematics 89, American Mathematical Society.
47. J. P. Hutchinson and G. L. Miller. Deleting vertices to make graphs of positive genus planar. Discrete Algorithms and Complexity Theory, Proceedings of the Japan-US Joint Seminar, Kyoto, Japan, 81-98, 1987. Academic Press.
48. H. Imai and K. Iwano. Efficient sequential and parallel algorithms for planar minimum cost flow. Proc. SIGAL Int. Symp. Algorithms, 21-30, 1990. Lecture Notes Comput. Sci. 450, Springer-Verlag.
49. A. Itai and Y. Shiloach. Maximum flow in planar networks. SIAM J. Comput. 8:135-150, 1979.
50. D. B. Johnson and S. M. Venkatesan. Partition of planar flow networks (preliminary version). Proc. 24th IEEE Symp. Found. Comput. Sci., 259-264, 1983. IEEE Computer Society.
51. S. N. Kabadi and Y. P. Aneja. approximation minimization of convex functions in fixed dimension. Oper. Res. Lett. 18:171-176, 1996.
52. S. N. Kabadi and Y. P. Aneja. Equivalence of ε-approximate separation and optimization in fixed dimensions. Algorithmica 29:582-594, 2001.
53. P. Klein. Multiple-source shortest paths in planar graphs. Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms, 146-155, 2005.
54. P. Klein, S. Mozes, and O. Weimann. Shortest paths in directed planar graphs with negative lengths: A linearspace O(n log2 n)-time algorithm. Proc. 20th Ann. ACMSIAM Symp. Discrete Algorithms, 236-245, 2009.
55. M. Kutz. Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. Proc. 22nd Ann. ACM Symp. Comput. Geom., 430-438, 2006.
56. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal. 16:346-358, 1979.
57. M. Mareš. Two linear time algorithms for MST on minor closed graph classes. Archivum Mathematicum 40(3):315-320, 2004.
58. W. S. Massey. A basic course in algebraic topology. Springer-Verlag, 1991.
59. N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. Assoc. Comput. Mach. 30(4):852-865, 1983.
60. G. L. Miller. Isomorphism testing for graphs of bounded genus. Proc. 12th ACM Symp. Theory Comput., 225-235, 1980.
61. G. L. Miller and J. Naor. Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24(5):1002-10017, 1995.
62. B. Mohar and C. Thomassen. Graphs on Surfaces. Johns Hopkins University Press, 2001.
63. J. R. Munkres. Topology, 2nd edition. Prentice-Hall, 2000.
64. C. H. Norton, S. A. Plotkin, and É. Tardos. Using separation algorithms in fixed dimension. J. Algorithms 13(1):79-98, 1992.
65. J. B. Orlin. A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2):338-350, 1993.
66. V. Y. Pan and J. H. Reif. Fast and efficient parallel solution of sparse linear systems. SIAM J. Comput. 22(6):1227-1250, 1993.
67. D. Pe'er. On minimum spanning trees. Master's thesis, Hebrew University, 1998. hhttp://www.math.ias.edu/̃avi/STUDENTS/dpthesis.pdf.
68. 2 n) time. SIAM J. Comput. 12:71-81, 1983.
69. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics 24. Springer-Verlag, 2003.
70. A. Schrijver. On the history of combinatorial optimization (till 1960). Handbook of Discrete Optimization, 1-68, 2005. Elsevier.
71. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3):362-391, 1983.
72. S. Tazari and M. Müller-Hannemann. Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. Discrete Appl. Math. 157:673-684, 2009.
73. S. Toledo. Maximizing non-linear concave functions in fixed dimension. Complexity in Numerical Optimization, 429-447, 1993. World Scientific.
74. P. M. Vaidya. Speeding-up linear programming using fast matrix multiplication. Proc. 30th IEEE Symp. Found. Comput. Sci., 332-337, 1989.
75. S. M. Venkatesan. Algorithms for network flows. Ph.D. thesis, The Pennsylvania State University, 1983. Cited in [50].
76. K. Weihe. Edge-disjoint (s, t)-paths in undirected planar graphs in linear time. J. Algorithms 23(1):121-138, 1997.
77. K. Weihe. Maximum (s, t)-flows in planar networks in O(|V|log |V|)-time. J. Comput. Syst. Sci. 55(3):454-476, 1997.