scientific article; zbMATH DE number 1303564

zbMath0930.68176MaRDI QIDQ4250189

Goran Konjevod, R. Ravi, Naveen Garg

Publication date: 17 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

VLSI designgroup Steiner tree problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items

Approximation algorithms for the covering Steiner problem, Budget constrained minimum cost connected medians, On the approximability of dense Steiner problems, An Efficient Approximation Algorithm for the Steiner Tree Problem, Meet and merge: approximation algorithms for confluent flows, A tight bound on approximating arbitrary metrics by tree metrics, Approximation algorithms for the connected sensor cover problem, Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems, Approximation algorithms for connected maximum cut and related problems, On the Clustered Steiner Tree Problem, Steiner Problems with Limited Number of Branching Nodes, On the clustered Steiner tree problem, Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)