Efficient algorithms for shared backup allocation in networks with partial information

DOI10.1007/S10878-006-8902-2zbMATH Open1117.90007OpenAlexW2053781116MaRDI QIDQ857776FDOQ857776

Authors: Yigal Bejerano, Alexander Sprintson, Joseph (Seffi) Naor 

Publication date: 5 January 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-8902-2

Recommendations

• Algorithms – ESA 2005
• scientific article; zbMATH DE number 2086939
• Building edge-failure resilient networks
• Finding disjoint paths with related path costs
• scientific article; zbMATH DE number 1835984

zbMATH Keywords

Combinatorial optimizationApproximation algorithmsFault resilienceQuality of serviceResource sharingRestoration

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Building edge-failure resilient networks

Cited In (2)

• Algorithms – ESA 2005
• Building edge-failure resilient networks

This page was built for publication: Efficient algorithms for shared backup allocation in networks with partial information

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