Improving multicut in directed trees by upgrading nodes

DOI10.1016/J.EJOR.2005.12.044MaRDI QIDQ2643926zbMATH OpenOpenAlexFDO

Authors Xiucui Guan, Jianzhong Zhang

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)

Recommendations

• A class of node based bottleneck improvement problems
• scientific article; zbMATH DE number 1163718
• Improving Minimum Cost Spanning Trees by Upgrading Nodes
• scientific article; zbMATH DE number 1262800
• Improving spanning trees by upgrading nodes

Cites work

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

Cited in

(2)

• A class of node based bottleneck improvement problems
• Improving spanning trees by upgrading nodes

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

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