New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem

DOI10.1007/978-3-540-68891-4_24zbMath1143.90376OpenAlexW1504328953MaRDI QIDQ3503858

Vijay V. Vazirani, Deeparnab Chakrabarty, Nikhil R. Devanur

Publication date: 10 June 2008

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_24

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

A partition-based relaxation for Steiner trees ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems ⋮ Approaches to the Steiner Problem in Networks

This page was built for publication: New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem