Pages that link to "Item:Q1881568"

The following pages link to Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation (Q1881568):

Displaying 14 items.

• Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
• A unified approach to approximating partial covering problems (Q633845) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
• An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
• Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
• Virtual machine placement for minimizing connection cost in data center networks (Q1751257) (← links)
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
• Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
• Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971) (← links)
• A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
• Pruning 2-connected graphs (Q2428662) (← links)
• On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
• A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)