scientific article; zbMATH DE number 1303564

MaRDI QIDQ4250189zbMATH OpenFDO

Authors Naveen Garg, Goran Konjevod, R. Ravi

Publication date 17 June 1999

zbMATH Keywords

VLSI designgroup Steiner tree problem

Mathematics Subject Classification ID

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

Recommendations

• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• A greedy approximation algorithm for the group Steiner problem
• An improved approximation scheme for the Group Steiner Problem
• Approximation algorithms for the covering Steiner problem

Cited in

(30)

• Balls and funnels: energy efficient group-to-group anycasts
• Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
• On the clustered Steiner tree problem
• Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
• On the clustered Steiner tree problem
• An improved approximation scheme for the Group Steiner Problem
• Steiner problems with limited number of branching nodes
• Algorithms and Computation
• Approximation algorithm for the group Steiner network problem
• Approximation algorithms for the covering Steiner problem
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• Budget constrained minimum cost connected medians
• Meet and merge: approximation algorithms for confluent flows
• scientific article; zbMATH DE number 2119643 (Why is no real title available?)
• A greedy approximation algorithm for the group Steiner problem
• An FPTAS for the fractional group Steiner tree problem
• On the approximability of dense Steiner problems
• Node-weighted Steiner tree and group Steiner tree in planar graphs
• A tight bound on approximating arbitrary metrics by tree metrics
• Beyond metric embedding: approximating group Steiner trees on bounded treewidth graphs
• scientific article; zbMATH DE number 139784 (Why is no real title available?)
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• Approximating fault-tolerant group-Steiner problems
• Approximation algorithms for group prize-collecting and location-routing problems
• Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
• Some formulations for the group Steiner tree problem
• Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)
• scientific article; zbMATH DE number 1445321 (Why is no real title available?)
• scientific article; zbMATH DE number 1775395 (Why is no real title available?)
• Approximating fault-tolerant group-Steiner problems

This page was built for publication:

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