The load-distance balancing problem

DOI10.1002/net.20477zbMath1242.68004OpenAlexW2094826920MaRDI QIDQ2892142

Samir Khuller, Jian Li, Edward Bortnikov, Joseph (Seffi) Naor, Yishay Mansour

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20477

zbMATH Keywords

approximation algorithmshardnessserverclientfacility assignmentload-distance balancing (LDB)

Mathematics Subject Classification ID

Applications of game theory (91A80) Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand, \(k\)-balanced center location problem: a new multi-objective facility location problem

Cites Work

• Unnamed Item
• From stars to comets: improved local search for universal facility location
• Wireless mesh networks: a survey
• A threshold of ln n for approximating set cover
• How to Allocate Network Centers
• The facility location problem with general cost functions
• The Capacitated K-Center Problem