Efficient recovery from power outage (extended abstract)
From MaRDI portal
Publication:2819589
DOI10.1145/301250.301406zbMath1345.90042OpenAlexW2010912147MaRDI QIDQ2819589
Baruch Schieber, Joseph (Seffi) Naor, Anna Moss, Sudipto Guha
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301406
Related Items
An approximation algorithm for maximum weight budgeted connected set cover, Approximations for restrictions of the budgeted and generalized maximum coverage problems, Incremental network design with shortest paths, Interdependent network restoration: on the value of information-sharing, Network construction problems with due dates, A survey of models and algorithms for emergency response logistics in electric distribution systems. II: Contingency planning level, Online scheduling problems with flexible release dates: applications to infrastructure restoration, Network construction/restoration problems: cycles and complexity, Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems, Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem, Approximating some network design problems with node costs, Lateness Minimization in Pairwise Connectivity Restoration Problems, Optimisation of electrical network configuration: complexity and algorithms for ring topologies, Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs, Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem, Online Node-weighted Steiner Forest and Extensions via Disk Paintings, Tree optimization based heuristics and metaheuristics in network construction problems, Interdependent integrated network design and scheduling problems with movement of machines, Spider Covering Algorithms for Network Design Problems
