An FPTAS for the fractional group Steiner tree problem

DOI10.17535/CRORR.2015.0039MaRDI QIDQ2966477zbMATH OpenOpenAlexFDO

Authors Slobodan Jelić

Publication date 7 March 2017

Published in Croatian operational research review (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.17535/crorr.2015.0039

zbMATH Keywords

approximation algorithmLagrangean relaxationfully polynomial time approximation schemegroup Steiner tree problemcovering linear programfractional group Steiner tree problempacking linear program

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• An improved approximation scheme for the Group Steiner Problem
• A greedy approximation algorithm for the group Steiner problem
• scientific article; zbMATH DE number 1303564
• Approximation algorithms for the covering Steiner problem

Cited in

(1)

• Approximating fault-tolerant group-Steiner problems

This page was built for publication: An FPTAS for the fractional group Steiner tree problem

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