Capacity-constrained network-Voronoi diagram: A summary of results

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

Volumn 8098 LNCS, Issue , 2013, Pages 56-73

  Yang, KwangSoo ^a   Shekhar, Apurv Hirsh ^a   Oliver, Dev ^a   Shekhar, Shashi ^a  

^a University of Minnesota   (United States)

Author keywords

Capacity Constrained Network Voronoi Diagram; Pressure Equalization; Spatial Network Partitioning

Indexed keywords

CAPACITY CONSTRAINTS; COMPUTATIONAL COSTS; NETWORK VORONOI DIAGRAMS; PRESSURE EQUALIZATION; SERVICE CENTER; SOLUTION QUALITY; SPATIAL NETWORK; TRANSPORTATION NETWORK;

COMPUTATIONAL GEOMETRY; COST ACCOUNTING;

GRAPHIC METHODS;

EID: 84881233121     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40235-7_4     Document Type: Conference Paper

References (30)

1. ABC News: Hurricane sandy's aftermath: Long lines at gas stations (2012), http://goo.gl/omQ62 (retrieved March 2013)
2. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19(17), 248-264 (1972)
3. Tomizawa, N.: On some techniques useful for solution of transportation network problems. Networks 2(17), 173-194 (1971)
4. Daskin, M.: Network and discrete location: models, algorithms, and applications. Wiley-Interscience series in discrete mathematics and optimization. Wiley (1995)
5. Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Operations Research 41(2), 338-350 (1993)
6. Goldberg, A.V.: An efficient implementation of a scaling minimum-cost flow algorithm. Operations Research 22(1), 1-29 (1997)
7. Ahuja, R., Magnanti, T., Orlin, J.: Network flows: theory, algorithms, and applications. Prentice Hall (1993)
8. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. A. Springer (2003)
9. Korte, B., Vygen, J.: Combinatorial Optimization. Algorithms and Combinatorics. Springer, Heidelberg (2012)
10. Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1-2), 83-97 (1955)
11. Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial & Applied Mathematics 5(1), 32-38 (1957)
12. Goldberg, A., Tarjan, R.: Solving minimum-cost flow problems by successive approximation. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 7-18. ACM (1987)
13. Frank, A.: Connections in combinatorial optimization, vol. 38. Oxford Univ. Pr. (2011)
14. Cook, W., Cunningham, W., Pulleyblank, W., Schrijver, A.: Combinatorial Optimization. Wiley Series in Discrete Mathematics and Optimization. Wiley (2011)
15. Johnson, D.S., McGeoch, C.C.: Network flows and matching: first DIMACS implementation challenge, vol. 12. Amer. Mathematical Society (1993)
16. Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research 15(3), 430-466 (1990)
17. Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Management Science 14(3), 205-220 (1967)
18. Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM (JACM) 36(4), 873-886 (1989)
19. Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial tessellations: concepts and applications of Voronoi diagrams, vol. 501. Wiley (2009)
20. Okabe, A., Sugihara, K.: Spatial Analysis Along Networks: Statistical and Computational Methods. Statistics in Practice. Wiley (2012)
21. Erwig, M.: The graph voronoi diagram with applications. Networks 36(3), 156-163 (2000)
22. Okabe, A., Satoh, T., Furuta, T., Suzuki, A., Okano, K.: Generalized network voronoi diagrams: Concepts, computational methods, and applications. International Journal of Geographical Information Science 22(9), 965-994 (2008)
23. Gyo{combining double acute accent}ri, E.: On division of graphs to connected subgraphs. In: Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), vol. 1, pp. 485-494 (1976)
24. Lovász, L.: A homology theory for spanning trees of a graph. Acta Mathematica Academiae Scientiarum Hungarica 30(3-4), 241-251 (1993)
25. Gyo{combining double acute accent}ri, E.: Partition conditions and vertex-connectivity of graphs. Combinatorica 1(3), 263-273 (1981)
26. Dyer, M., Frieze, A.: On the complexity of partitioning graphs into connected subgraphs. Discrete Applied Mathematics 10(2), 139-153 (1985)
27. Diwan, A.A.: Partitioning into connected parts (slide 7) in graph partitioning problems. In: Research Promotion Workshop on Introduction to Graph and Geometric Algorithms (January 2011), http://goo.gl/b8fTN
28. Barth, D., Fournier, H.: A degree bound on decomposable trees. Discrete Mathematics 306(5), 469-477 (2006)
29. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM) 34(3), 596-615 (1987)
30. OpenStreetMap, http://goo.gl/Hso0 (retrieved January 2013)