scientific article; zbMATH DE number 7053316

zbMath1423.68599MaRDI QIDQ5743437

Petr Kolman, Christian Scheideler

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095180

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Flows in graphs (05C21)

Related Items (1)

Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multiroute maximum flows in networks
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Maximal Flow Through a Network
• Algorithms for 2-Route Cut Problems
• A Simple Greedy Algorithm for the k-Disjoint Flow Problem
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Distributed Computing

This page was built for publication: