A fixed-parameter tractability result for multicommodity demand flow in trees

DOI10.1016/j.ipl.2005.10.004zbMath1184.68357OpenAlexW2152306584MaRDI QIDQ1045910

Rolf Niedermeier, Jiong Guo

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

zbMATH Keywords

combinatorial problemsgraph algorithmsNP-hard problemsfixed-parameter tractabilityexact algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

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

This page was built for publication: A fixed-parameter tractability result for multicommodity demand flow in trees