Approximating Generalized Multicut on Trees

DOI10.1007/978-3-540-73001-9_85MaRDI QIDQ5425385zbMATH OpenOpenAlexFDO

Authors Peng Zhang

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_85

zbMATH Keywords

TreeCombinatorial OptimizationApproximation AlgorithmGeneralized Multicut

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• An approximation algorithm for the generalized k-multicut problem
• Partial multicuts in trees
• Approximation and Online Algorithms
• An approximation algorithm for the k-prize-collecting multicut on a tree problem
• On the generalized multiway cut in trees problem

Cited in

(10)

• An approximation algorithm for the generalized k-multicut problem
• An approximation algorithm for the B-prize-collecting multicut problem in trees
• A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
• scientific article; zbMATH DE number 6850362 (Why is no real title available?)
• A primal dual approximation algorithm for the multicut problem in trees with submodular penalties
• Approximation and Online Algorithms
• Partial multicuts in trees
• An approximation algorithm for the k-prize-collecting multicut on a tree problem
• On the generalized multiway cut in trees problem
• On the generalized multiway cut in trees problem

This page was built for publication: Approximating Generalized Multicut on Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425385)