Approximating the weight of shallow Steiner trees
type: Item
instance of: scholarly article
title: Approximating the weight of shallow Steiner trees
zbMATH Open document ID: 0931.68077
DOI: 10.1016/S0166-218X(99)00111-0
author: Guy Kortsarz
author: David Peleg
published in: Discrete Applied Mathematics
publication date: 2000-02-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1319814
zbMATH Keywords: Steiner trees
MaRDI profile type: Publication
cites work: Generalized submodular cover problems and applications
cites work: Q4250182
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
cites work: Q4228484
cites work: Q4198056
cites work: Approximation Schemes for the Restricted Shortest Path Problem
cites work: Approximation algorithms for combinatorial problems
cites work: Routing to Multiple Destinations in Computer Networks
cites work: Balancing minimum spanning trees and shortest-path trees
cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
cites work: Q3128918
cites work: Q5501786
cites work: On the ratio of optimal integral and fractional covers
cites work: On the hardness of approximating minimization problems
cites work: Bicriteria Network Design Problems
cites work: The network inhibition problem
cites work: Many birds with one stone
cites work: Q3128917
cites work: Q4527015
cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
cites work: An analysis of the greedy algorithm for the submodular set covering problem
Wikidata QID: Q126382960
description: scientific article; zbMATH DE number 1319814