Pages that link to "Item:Q3654382"
From MaRDI portal
The following pages link to A Constant Factor Approximation for the Single Sink Edge Installation Problem (Q3654382):
Displaying 10 items.
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- Two-level hub Steiner trees (Q2059893) (← 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)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Exact Approaches for Designing Multifacility Buy-at-Bulk Networks (Q5131690) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)