scientific article; zbMATH DE number 7122314

DOI10.4230/OASIcs.SOSA.2018.3zbMath1433.68068MaRDI QIDQ5240417

Mark Idleman, Chandra Chekuri

Publication date: 25 October 2019

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

multipath routingmultiroute flowscongestion minimization

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Reserving Resilient Capacity in a Network
• Prize-Collecting Survivable Network Design in Node-Weighted Graphs
• Dependent rounding and its applications to approximation algorithms
• Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
• A constructive proof of the general lovász local lemma
• Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
• New Constructive Aspects of the Lovász Local Lemma

This page was built for publication: