Pages that link to "Item:Q3587402"

The following pages link to Network Design via Core Detouring for Problems without a Core (Q3587402):

Displaying 10 items.

• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
• Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
• LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
• A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
• An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
• Oblivious Buy-at-Bulk in Planar Graphs (Q3078378) (← links)
• LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
• Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
• Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)