Variations of the prize‐collecting Steiner tree problem

DOI10.1002/net.20106zbMath1103.90096OpenAlexW4253133138MaRDI QIDQ5487807

Abraham P. Punnen, Olena Chapovska

Publication date: 12 September 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20106

zbMATH Keywords

complexityalgorithmsnetworksSteiner treesbottleneck problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (3)

A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks ⋮ An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions ⋮ Capacitated ring arborescence problems with profits

Cites Work

• Unnamed Item
• Unnamed Item
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Approximation algorithms for constrained for constrained node weighted steiner tree problems
• Algorithms - ESA 2003

This page was built for publication: Variations of the prize‐collecting Steiner tree problem