Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs

Combinatorics Probability and Computing

Volumn 9, Issue 6, 2000, Pages 489-511

  Díaz, Josep ^a   Penrose, Mathew D ^b   Petit, Jordi ^a   Serna, María ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034555999     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300004454     Document Type: Article

References (37)

1. Adolphson, D. (1977) Single machine job sequencing with precedence constraints. SIAM J. Comput. 6 40-54.
2. Adolphson, D. and Hu, T. C. (1973) Optimal linear ordering. SIAM J. Appl. Math. 25 403-423.
3. Beardwood, J., Halton, J. and Hammersley, J. M. (1959) The shortest path through many points. Proc. Cambridge Philos. Society 55 299-327.
4. Berry, J. W. and Goldberg, M. K. (1999) Path optimization for graph partitioning problems. Discrete Applied Mathematics: Combinatorial Algorithms, Optimization and Computer Science 90 27-50.
5. Bhatt, S. N. and Leighton, F. T. (1984) A framework for solving VLSI graph layout problems. J. Comput. System Sci. 28 300-343.
6. Bollobás, B. and Leader, I. (1991) Compressions and isoperimetric inequalities. J. Combin. Theory Ser. A 56 47-62.
7. Botafogo, R. A. (1993) Cluster analysis for hypertext systems. In 16th Annual ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 116-125.
8. Chung, K. L. (1974) A Course in Probability Theory, Academic Press, New York.
9. 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, Tokyo, Japan, July 26-28, 1999 (T. Asano, H. Imai, D. T. Lee, S. Nakano and T. Tokuyama, eds), Vol. 1627 of Springer Lecture Notes in Computer Science.
10. Díaz, J., Penrose, M. D., Petit, J. and Serna, M. (1999) Linear ordering of random geometric graphs. In P. Wiedmayer and G. Neyer, editors, Graph Theoretic Concepts in Computer Science, volume 1665. Springer, Lecture Notes in Computer Science.
11. 2. In Randomization and Approximation Techniques in Computer Science (M. Luby, J. Rolim and M. Serna, eds), Vol. 1518 of Springer Lecture Notes in Computer Science.
12. Díaz, J., Petit, J., Serna, M. and Trevisan, L. (2000) Approximating layout problems on random graphs. To appear in Discrete Math.
13. Dunford, N. and Schwartz, J. (1958) Linear Operators, Part I: General Theory, Interscience, New York.
14. Grimmett, G. (1999) Percolation, 2nd edn, Springer, Heidelberg.
15. Harper, L. H. (1977) Stabilization and the edgesum problem. Ars Combinatoria 4 225-270.
16. Johnson, D. S., Aragon, C. R., McGeoch, L. A. and Schevon, C. (1989) Optimization by simulated annealing: an experimental evaluation, Part I: graph partitioning. Operations Research 37 865-892.
17. Junguer, M., Reinelt, G. and Rinaldi, G. (1995) The travelling salesman problem. In Handbook on Operations Research and Management Sciences, Vol. 7 (C. L. Monma, M. Ball, T. Magnanti and G. L. Nemhauser, eds), North-Holland, pp. 225-330.
18. Karp, R. M. (1993) Mapping the genome: some combinatorial problems arising in molecular biology. In 24th ACM Symposium on the Theory of Computing, pp. 278-285.
19. Kendall, D. G. (1969) Incidence matrices, interval graphs, and seriation in archeology. Pacific J. Math. 28 565-570.
20. Kesten, H. (1982) Percolation Theory for Mathematicians, Birkhäuser, Boston, MA.
21. Lang, K. and Rao, S. (1993) Finding near-optimal cuts: An empirical evaluation. In 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 212-221.
22. Leighton, F. T. (1993) Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA.
23. Makedon, F. and Sudborough, I. H. (1983) Minimizing width in linear layouts. In Proc. 10th International Colloquium on Automata, Languages and Programming (J. Díaz, ed.), Springer Lecture Notes in Computer Science, pp. 478-490.
24. Mitchison, G. and Durbin, R. (1986) Optimal numberings of an n × n array. SIAM J. Discrete Math. 7 571-582.
25. Muradyan, D. O. and Piliposjan, T. E. (1980) Minimal numberings of vertices of a rectangular lattice. Akad. Nauk. Armjan. SRR 1 21-27. In Russian.
26. Mutzel, P. (1995) A polyhedral approach to planar augmentation and related problems. In European Symposium on Algorithms (P. Spirakis, ed.), Vol. 979 of Springer Lecture Notes in Computer Science, pp. 497-507.
27. Pach, J., Shahrokhi, F. and Szegedy, M. (1996) Applications of the crossing number. Algoritmica 16 111-117.
28. Papadimitriou, C. H. and Sideri, M. (1990) The bisection width of grid graphs. In 1st ACM-SIAM Symposium on Discrete Algorithms, San Francisco, pp. 405-410,
29. Penrose, M. D. (1995) Single linkage clustering and continuum percolation. J. Multivariate Analysis 53 94-109.
30. Penrose, M. D. (1999) Vertex ordering and partition problems for random spatial graphs. To appear in Ann. Appl. Probab. 10.
31. Petit, J. (1998) Approximation heuristics and benchmarkings for the MINLA PROBLEM. In Alex '98: Building Bridges Between Theory and Applications (R. Battiti and A. A. Bertossi, eds), Università di Trento.
32. Ravi, R., Agrawal, A. and Klein, P. (1991) Ordering problems approximated: single-processor scheduling and interval graph completion. In 18th International Colloquium on Automata, Languages and Programming (M. Rodriguez, J. Leach and B. Monien, eds), Vol. 510 of Springer Lecture Notes in Computer Science, pp. 751-762.
33. Robertson, N. and Seymour, P. D. (1985) Graph minors: a survey. In Surveys in Combinatorics 1985 (Glasgow, 1985), Cambridge Univ. Press, Cambridge, pp. 153-171.
34. Saad, Y. (1996) Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston.
35. Shing, M. T. and Hu, T. C. (1986) Computational complexity of layout problems. In Layout Design and Verification (T. Ohtsuki, ed.), North-Holland, Amsterdam, pp. 267-294.
36. Steele, J. M. (1997) Probability Theory and Combinatorial Optimization, SIAM CBMS-NSF Regional Conference Series in Applied Mathematics.
37. Yukich, J. E. (1998) Probability Theory of Classical Euclidean Optimization Problems, Springer, Heidelberg.