Pages that link to "Item:Q3395048"

The following pages link to Cost-Distance: Two Metric Network Design (Q3395048):

Displaying 18 items.

• Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
• Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
• LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
• A review of hierarchical facility location models (Q868995) (← links)
• A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
• Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
• Improved approximation algorithms for multilevel facility location problems (Q1866994) (← links)
• An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
• Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
• Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
• Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
• LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
• Online Buy-at-Bulk Network Design (Q4577806) (← links)
• Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
• Optimal shrinking of the distribution chain: the facilities delocation decision (Q5494701) (← links)
• (Q5743493) (← links)
• Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)