Unsplittable Anycast Flow Problem: Formulation and Algorithms

DOI10.1007/11758501_83MaRDI QIDQ3545051zbMATH OpenOpenAlexFDO

Authors Krzysztof Walkowiak

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758501_83

zbMATH Keywords

anycastconnection-oriented networkUFP

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• New Algorithms for the Unsplittable Flow Problem
• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms
• A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks
• Improved bounds for the unsplittable flow problem
• Anycasting in connection-oriented computer networks: Models, algorithms and results

Cited in

(4)

• A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks
• Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms

This page was built for publication: Unsplittable Anycast Flow Problem: Formulation and Algorithms

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