Vertex ordering and partitioning problems for random spatial graphs

Annals of Applied Probability

Volumn 10, Issue 2, 2000, Pages 517-538

  Penrose, Mathew D ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Combinatorial optimization; Connectivity; Geometric probability; Large deviations; Percolation; Random graphs

Indexed keywords

EID: 0034378089     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1019487353     Document Type: Article

References (34)

1. BEARDWOOD, J., HALTON, J. and HAMMERSLEY, J. M. (1959). The shortest path through many points. Proc. Cambridge Philos. Soc. 55 299-327.
2. J. W. BERRY and M. K. GOLDBERG. (1999). Path optimization for graph partitioning problems. Discrète Applied Math. 90 27-50.
3. BHATT, S. N. and LEIGHTON, F. T. (1984). A framework for solving VLSI graph layout problems. J. Comput. System Sci. 28 300-343.
4. BOLLOBÁS, B. (1979). Graph Theory. Springer, New York.
5. BOPPANA, R. (1987). Eigenvalues and graph bisection: An average case analysis. In Proceedings of the 28th Symposium on the Foundations of Computer Science 280-285. IEEE Computer Society Press, Washington D.C.
6. BUI, T., CHAUDHURI, S., LEIGHTON, T. and SIPSER, M. (1987). Graph bisection algorithms with good average case behavior. Combinatorica 7 171-191.
7. DÍAZ, J., GIBBONS, A.M., PATERSON, M.S. and TORÁN, J. (1991). The MINSUMCUT problem. In Algorithms and Data Structures: Second Workshop 1991. Lecture Notes in Comput. Sci. 519 65-79. Springer, New York.
8. DÍAZ, J., PENROSE, M.D., PETIT, J. and SERNA, M. (1999). Approximating layout problems on random geometric graphs. Preprint.
9. DÍAZ, J., PENROSE, M.D., PETIT, J. and SERNA, M. (1999). Convergence theorems for some layout measures on random lattice and random geometric graphs. Preprint.
10. DÍAZ, J., PENROSE, M.D., PETIT, J. and SERNA, M. (1999). Layout problems on lattice graphs. In Computing and Combinatorics: 5th Annual International Conference, COCOON'99. Lecture Notes in Comput. Sci. 1627. Springer, New York.
11. DÍAZ, J., PETIT, J., SERNA, M. and TREVISAN, L. (1998). Approximating layout problems on random sparse graphs. Report de recerca LSI-98-44-R, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya. http://www.lsi.upc.es/dept/techreps.
12. DIEKMANN, R., MONIEN, B. and PREIS, R. (1995). Using helpful sets to improve graph bisections. In Interconnection Networks and Mapping and Scheduling Parallel Computations (D. F. Hsu, A.L. Rosenberg, and D. Sotteau, eds.) 57-73. Amer. Math. Soc., Providence, RI.
13. DIEKMANN, R., LÜLING, R., MONIEN, B. and C. SPRÄNER, C. (1996). Combining helpful sets and parallel simulated annealing for the graph-partitioning problem. Parallel Algorithms and Applications 8 61-84.
14. GAREY, M. R., JOHNSON, D. S. and STOCKMEYER, L. (1976). Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1 237-267.
15. GRIMMETT, G. (1989). Percolation. Springer, New York.
16. HARARY, F. (1967). Problem 16. In Graph Theory and Computing (M. Fiedler, ed.) 161. Czech. Academy of Sciences.
17. HARPER, L. H. (1966). Optimal numberings and isoperimetric problems on graphs. J. Combinatorial Theory 1 385-393.
18. HARPER, L.H. (1977). Stabilization and the edgesum problem. Ars Combinatorica 4 225-270.
19. JOHNSON, D. S., ARAGON, C. R., McGEOCH, L. A. and SCHEVON, C. (1989). Optimization by simulated annealing: An experimental evaluation; Part I, Graph partitioning. Oper. Res. 37 865-892.
20. LANG, K. and RAO, S. (1993). Finding near-optimal cuts: An empirical evaluation. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms 212-221. Assoc. Comput. Mach., New York; SIAM, Philadelphia.
21. LENGAUER, T. (1981). Black-white pebbles and graph separation. Acta Inf. 16 465-475.
22. LENGAUER, T. (1982). Upper and lower bounds on the complexity of the min-cut linear arrangements problem on trees. SIAM J. Algebraic Discrete Methods 3 99-113.
23. MEESTER, R. and ROY, R. (1996). Continuum Percolation. Cambridge Univ. Press.
24. MITCHISON, G. and DURBIN, R. (1986). Optimal numberings of an n × n array. SIAM J. Disc. Math. 7 571-582.
25. PENROSE, M.D. (1995). Single linkage clustering and continuum percolation. J. Multivariate Anal. 53 94-109.
26. PENROSE, M.D. and PISZTORA, A. (1996). Large deviations for discrete and continuous percolation. Adv. in Appl. Probab. 28 29-52.
27. PETIT, J. (1997). Approximation heuristics and benchmarkings for the MINLA problem. In Algorithms and Experiments (ALEX98) - Building Bridges between Theory and Applications (R. Battiti and A. Bertossi, eds.) Università di Trento; http://www.lsi.upc.es/~jpetit/Publications. (Also: Report de recerca LSI-97-41-R, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, http://www.lsi.upc.es/dept/techreps.)
28. PETIT, J. (1997). Combining spectral sequencing with simulated annealing for the MINLA problem: Sequential and parallel heuristics. Report de recerca LSI-97-46-R, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, http://www.lsi.upc.es/dept/techreps.
29. RAO, S. and RICHA, A. W. (1998). New approximation techniques for some ordering problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms 211- 218. SIAM, Philadelphia.
30. SANGIONVANNI-VINCENTELLI, A. (1987). Automatic layout of integrated circuits. In Design Systems for VLSI Circuits; Logic Synthesis and Silicon Compilation (G. De Micheli, A. Sangionvanni-Vincentelli and P. Antognetti eds.) 113-195. NATO Advanced Study Institute. M. Nijhoff, Dordrecht.
31. STEELE, J. M. (1997). Probability Theory and Combinatorial Optimization. SIAM, Philadelphia.
32. TURNER, J. S. (1986). On the probable performance of heuristics for bandwidth minimization. SIAM J. Comput. 15 561-580.
33. WILLIAMS, D. (1991). Probability with Martingales, Cambridge Univ. Press.
34. YUKICH, J. E. (1998). Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Math. 1675. Springer, Berlin.