Login / Signup

Maximum Flows on Disjoint Paths.

Guyslain NavesNicolas SonneratAdrian Vetta
Published in: APPROX-RANDOM (2010)
Keyphrases
  • disjoint paths
  • approximation algorithms
  • directed graph
  • undirected graph
  • databases
  • information systems
  • three dimensional
  • special case
  • multi dimensional