scientific article; zbMATH DE number 2038744

MaRDI QIDQ4449209zbMATH OpenFDO

Authors Dimitris Fotakis

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190637.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Discrete location and assignment (90B80)

Recommendations

• On the competitive ratio for online facility location
• A simple and deterministic competitive algorithm for online facility location
• A primal-dual algorithm for online non-uniform facility location
• Online facility location with facility movements
• A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem

Cited in

(17)

• Towards flexible demands in online leasing problems
• Online facility location with mobile facilities
• On the competitive ratio for online facility location
• Incremental algorithms for facility location and \(k\)-median
• Randomized online algorithms for set cover leasing problems
• Strategic online facility location
• Offline and Online Facility Leasing
• The Competitiveness of On-Line Assignments
• Online facility location against a \(t\)-bounded adversary
• Online facility location with deletions
• Online facility location with facility movements
• Online facility assignment
• Online facility assignment
• Incremental facility location problem and its competitive algorithms
• A simple and deterministic competitive algorithm for online facility location
• A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
• A primal-dual algorithm for online non-uniform facility location

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449209)