Improving multicut in directed trees by upgrading nodes

DOI10.1016/j.ejor.2005.12.044zbMath1135.90003OpenAlexW1983608172MaRDI QIDQ2643926

Xiucui Guan, Zhang, Jianzhong

Publication date: 27 August 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.044

zbMATH Keywords

network improvement problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Minimal multicut and maximal integer multiflow: a survey
• Communication-efficient parallel algorithms for distributed random-access machines
• Approximation algorithms for certain network improvement problems
• Improving spanning trees by upgrading nodes
• A class of node based bottleneck improvement problems
• Discrete Mathematics
• Multiway cuts in node weighted graphs
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• Upgrading bottleneck constrained forests

This page was built for publication: Improving multicut in directed trees by upgrading nodes