Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Lecture Notes in Computer Science - Germany
doi 10.1007/11671541_4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

2020English

Corrigendum: Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
MathematicsComputer Science
2001English

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A Logarithmic Approximation for Unsplittable Flow on Line Graphs

2009English

Efficient Algorithms for Listing K Disjoint St-Paths in Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Fast Approximation Algorithms for Multicommodity Flow Problems

1991English

Submodular Unsplittable Flow on Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Submodular Unsplittable Flow on Trees

Mathematical Programming, Series B
MathematicsSoftware
2018English

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy