Upgrading bottleneck constrained forests (Q5928872): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Improving the location of minisum facilities through network modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Minimum Cost Spanning Trees by Upgrading Nodes / 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: The network inhibition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network upgrading problems / rank
 
Normal rank

Revision as of 15:59, 3 June 2024

scientific article; zbMATH DE number 1584469
Language Label Description Also known as
English
Upgrading bottleneck constrained forests
scientific article; zbMATH DE number 1584469

    Statements