scientific article; zbMATH DE number 1303564

zbMATH Open0930.68176MaRDI QIDQ4250189FDOQ4250189

Authors: Naveen Garg, Goran Konjevod, R. Ravi 

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

VLSI designgroup Steiner tree problem

Mathematics Subject Classification ID

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

Cited In (32)

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

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)