An approximation algorithm for network design problems with downwards-monotone demand functions (Q928296): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-007-0051-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997374695 / 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: Approximating minimum-cost graph problems with spanning tree edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy heuristic for a minimum-weight forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another greedy heuristic for the constrained forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank

Latest revision as of 11:42, 28 June 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for network design problems with downwards-monotone demand functions
scientific article

    Statements