Path decomposition under a new cost measure with applications to optical network design

DOI10.1145/1328911.1328926zbMath1445.68144OpenAlexW1984292362MaRDI QIDQ4962708

Lisa Zhang, Elliot Anshelevich

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1328911.1328926

zbMATH Keywords

approximation algorithmspath decompositionoptical network design

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (2)

Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games

This page was built for publication: Path decomposition under a new cost measure with applications to optical network design