An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design via Core Detouring for Problems without a Core / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Factor Approximation for the Single Sink Edge Installation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shallow-Light Steiner Arborescences with Vertex Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the single-sink buy-at-bulk network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing minimum spanning trees and shortest-path trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-Distance: Two Metric Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of some network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster min-max resource sharing in theory and practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737546 / rank
 
Normal rank

Latest revision as of 09:33, 28 July 2024

scientific article
Language Label Description Also known as
English
An improved approximation algorithm for the uniform cost-distance Steiner tree problem
scientific article

    Statements

    Identifiers