scientific article; zbMATH DE number 1775441
From MaRDI portal
Publication:4542573
zbMATH Open1028.68217MaRDI QIDQ4542573FDOQ4542573
Authors: Jon M. Kleinberg 
Publication date: 1 August 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (20)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
- Single-Sink Multicommodity Flow with Side Constraints
- Congestion-free rerouting of flows on DAGs
- The disjoint paths problem in quadratic time
- Adapting the directed grid theorem into an \textsf{FPT} algorithm
- Title not available (Why is that?)
- All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Improved algorithm for the half-disjoint paths problem
- Adapting the directed grid theorem into an FPT algorithm
- An Improved Algorithm for Finding Cycles Through Elements
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
- Combinatorial algorithms for the unsplittable flow problem
- Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- Combing a Linkage in an Annulus
- Towards the graph minor theorems for directed graphs
- Computing paths of large rank in planar frameworks deterministically
- An improved algorithm for the half-disjoint paths problem
- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542573)
