An FPTAS for the fractional group Steiner tree problem

DOI10.17535/CRORR.2015.0039zbMath1357.90168OpenAlexW2205876011MaRDI QIDQ2966477

Slobodan Jelić

Publication date: 7 March 2017

Published in: Croatian Operational Research Review (Search for Journal in Brave)

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

zbMATH Keywords

Lagrangean relaxationapproximation algorithmfully 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)

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