Approximation algorithm for the group Steiner network problem

DOI10.1002/NET.20151MaRDI QIDQ3428914zbMATH OpenOpenAlexFDO

Authors Michal Penn, Stas Rozenfeld

Publication date 30 March 2007

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmgroup Steiner networkinteger and linear programming

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2119643
• An improved approximation scheme for the Group Steiner Problem
• scientific article; zbMATH DE number 1303564
• scientific article; zbMATH DE number 139784
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

Cites work

• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 1003253 (Why is no real title available?)

Cited in

(7)

• Approximation algorithms for group prize-collecting and location-routing problems
• Solving group Steiner problems as Steiner problems.
• Some formulations for the group Steiner tree problem
• An improved approximation scheme for the Group Steiner Problem
• Approximating fault-tolerant group-Steiner problems
• An approximation algorithm for the Steiner connectivity problem
• Approximating fault-tolerant group-Steiner problems

This page was built for publication: Approximation algorithm for the group Steiner network problem

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