Local optimization on graphs

Discrete Applied Mathematics

Volumn 23, Issue 2, 1989, Pages 157-178

  Llewellyn, Donna Crystal ^a,b   Tovey, Craig ^a,b   Trick, Michael ^a,b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249022814     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(89)90025-5     Document Type: Article

References (19)

1. Minimization algorithms and random walk on the d-cube
2. The genus of the n-cube
3. Lengths of snakes in boxes
4. On the problem of partitioning planar graphs
5. Multidimensional searching problems
6. A separator theorem for graphs of bounded genus
7. Lower bounds on the worst-case complexity of some oracle algorithms
8. How easy is local search?
9. Generalized nested dissection
10. Some NP-complete problems in quadratic and nonlinear programming
11. Best algorithms for approximating the maximum of a submodular set function
12. Das Geschlecht des Vollständigen Paaren Graphen
13. A simplified NP-complete satisfiability problem
14. Low order polynomial bounds on the expected performance of local improvement algorithms
15. Multidimensional bisection and global minimization