Approximation algorithms for the covering Steiner problem (Q4537631): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4952696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2.5-factor approximation algorithm for the \(k\)-MST problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for large deviations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating planar metrics by tree metrics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees—Short or Small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768349 / rank
 
Normal rank

Latest revision as of 11:23, 4 June 2024

scientific article; zbMATH DE number 1762021
Language Label Description Also known as
English
Approximation algorithms for the covering Steiner problem
scientific article; zbMATH DE number 1762021

    Statements

    Identifiers