Primal-dual-based algorithms for a directed network design problem

DOI10.1287/IJOC.1040.0066MaRDI QIDQ2890464zbMATH OpenOpenAlexFDO

Authors Vardges Melkonian, Éva Tardos

Publication date 8 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1040.0066

zbMATH Keywords

analysis of algorithmsinteger programmingnetworks-graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1003253
• scientific article; zbMATH DE number 1342141
• Publication:4886063
• New primal-dual algorithms for Steiner tree problems
• Dual-based approximation algorithms for cut-based network connectivity problems

Cited in

(2)

• Approximation algorithms for constructing some required structures in digraphs
• New primal-dual algorithms for Steiner tree problems

This page was built for publication: Primal-dual-based algorithms for a directed network design problem

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