Download:
|
by Mathew D. Penrose, Jordi Petit
http://www.lsi.upc.es/~jpetit/Publications/./ps/cocoon99.ps.gz
Add To MetaCart
Abstract:
This work deals with bounds on the cost of layout problems for lattice graphs and random lattice graphs. Our main result in this paper is a convergence theorem for the optimal cost of the Minimum Linear Arrangement problem and the Minimum Sum Cut problem, for the case where the underlying graph is obtained through a subcritical site percolation process. This result can be viewed as an analogue of the Beardwood, Halton and Hammersley theorem for the Euclidian TSP. Finally we estimate empirically the value for the constant in the mentioned theorem.
Citations
|
164
|
A Course in Probability Theory
– Chung
- 1968
|
|
96
|
The shortest path through many points
– Beardwood, Halton, et al.
- 1959
|
|
57
|
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
– Frieze, Kaplan
|
|
48
|
Probability Theory and Combinatorial Optimization
– STEELE
- 1997
|
|
35
|
Linear layouts of generalized hypercubes
– Nakano
- 1993
|
|
23
|
2nd edition
– Grimmett
- 1999
|
|
18
|
Approximation heuristics and benchmarkings for the MinLA problem
– Petit
- 1998
|
|
16
|
Minimal numberings of vertices of a rectangular lattice
– Muradyan, Piliposjan
- 1980
|
|
14
|
The bisection width of grid graphs
– Papadimitriou, Sideri
- 1990
|
|
12
|
NP-completeness of several arrangement problems
– Even, Shiloach
- 1975
|
|
10
|
Linear Operators. Part I: General Theory. Interscience
– Dunford, Schwartz
- 1958
|
|
7
|
Optimal numberings of an n × n array
– Mitchison, Durbin
- 1986
|
|
7
|
Vertex ordering and partition problems for random spatial graphs
– Penrose
- 1999
|
|
6
|
Combining Spectral Sequencing with Simulated Annealing for the MinLA Problem: Sequential and Parallel Heuristics
– Petit
- 1997
|
|
2
|
Layout problems on lattice graphs. Report de recerca LSI-99-10-R, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya
– Díaz, Penrose, et al.
- 1999
|
