Probabilistic analysis of an lp relaxation bound for the steiner problem in networks

DOI10.1002/NET.3230190705zbMath0682.90090OpenAlexW2115981193MaRDI QIDQ4732318

Anjani Jain

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

relaxation boundSteiner tree problem in networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Linear programming (90C05)

Related Items (4)

A primal-dual approximation algorithm for the Steiner forest problem ⋮ An integer programming formulation of the Steiner problem in graphs ⋮ Continuous approximation formulas for location problems ⋮ A probabilistic analysis of the maximal covering location problem

Cites Work

• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Unnamed Item

This page was built for publication: Probabilistic analysis of an lp relaxation bound for the steiner problem in networks