A fixed-parameter tractability result for multicommodity demand flow in trees
From MaRDI portal
Publication:1045910
DOI10.1016/j.ipl.2005.10.004zbMath1184.68357MaRDI QIDQ1045910
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.004
combinatorial problems; graph algorithms; NP-hard problems; fixed-parameter tractability; exact algorithms
68W05: Nonnumerical algorithms
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Algorithmics for hard problems.
- Call control with \(k\) rejections
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Mathematical Foundations of Computer Science 2004
- Algorithms and Data Structures
- Graph-Theoretic Concepts in Computer Science