Cost thresholds for dynamic resource location

Discrete Applied Mathematics

Volumn 156, Issue 10, 2008, Pages 1846-1855

  Jacob Wildstrom, D ^a  

^a UNIVERSITY OF LOUISVILLE   (United States)

Author keywords

Dynamic location; Dynamic optimization; Lookahead; Window index

Indexed keywords

DECOMPOSABILITY; ELSEVIER (CO); PARAMETERIZING; RESOURCE LOCATION; SERVICE COSTS;

GRAPH THEORY;

EID: 45849139389     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.09.002     Document Type: Article

References (8)

1. Bandelt H.-J. Retracts of hypercubes. J. Graph Theory 8 4 (1984) 501-510
2. Y. Bartal, M. Charikar, P. Indyk, On page migration and other relaxed task systems, Theoret. Comput. Sci. 268 (1) (2001) 43-66, on-line algorithms (Udine, 1998).
3. Chrobak M., Larmore L.L., Reingold N., and Westbrook J. Page migration algorithms using work functions. J. Algorithms 24 1 (1997) 124-157
4. Chung F.R.K., Graham R.L., and Saks M.E. Dynamic search in graphs. Discrete Algorithms and Complexity (Kyoto, 1986), Perspectives in Computing vol. 15 (1987), Academic Press, Boston, MA 351-387
5. Chung F.R.K., Graham R.L., and Saks M.E. A dynamic location problem for graphs. Combinatorica 9 2 (1989) 111-131
6. D.E. Knuth, Personal communication (2005).
7. Nowakowski R., and Rival I. Fixed-edge theorem for graphs with loops. J. Graph Theory 3 4 (1979) 339-350
8. J. Westbrook, Randomized algorithms for multiprocessor page migration, in: On-line algorithms (New Brunswick, NJ, 1991), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 7, American Mathematical Society, Providence, RI, 1992, pp. 135-149.