Deterministic sampling algorithms for network design
From MaRDI portal
Publication:547282
DOI10.1007/S00453-009-9344-XzbMATH Open1216.68345OpenAlexW4233380597MaRDI QIDQ547282FDOQ547282
Recommendations
- Deterministic Sampling Algorithms for Network Design
- Random sampling in cut, flow, and network design problems
- Random sampling in cut, flow, and network design problems
- scientific article; zbMATH DE number 686900
- An exact algorithm for robust network design
- Approximation algorithms for network design problems
- Network design with probabilistic capacities
- THE PROBABILISTIC NETWORK DESIGN PROBLEM
- Perfect sampling for queues and network models
Cites Work
- scientific article; zbMATH DE number 5764797 (Why is no real title available?)
- scientific article; zbMATH DE number 5764866 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 1757956 (Why is no real title available?)
- scientific article; zbMATH DE number 2086941 (Why is no real title available?)
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
- A constant factor approximation for the single sink edge installation problems
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
- A tight bound on approximating arbitrary metrics by tree metrics
- An improved approximation algorithm for virtual private network design
- Analyzing the Held-Karp TSP bound: A monotonicity property with application
- Approximation Algorithms for Metric Facility Location Problems
- Approximation via cost sharing
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Boosted sampling
- Cost-sharing mechanisms for network design
- Deterministic Sampling Algorithms for Network Design
- Heuristic analysis, linear programming and branch and bound
- Improved Approximation for Single-Sink Buy-at-Bulk
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- Local search heuristic for k-median and facility location problems
- New Approaches for Virtual Private Network Design
- Pricing Tree Access Networks with Connected Backbones
- Primal-dual algorithms for connected facility location problems
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
- Simpler and better approximation algorithms for network design
- Survivable networks, linear programming relaxations and the parsimonious property
Cited In (13)
- Simpler and better approximation algorithms for network design
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
- Title not available (Why is no real title available?)
- The A priori traveling repairman problem
- Routing under uncertainty: the \textit{a priori} traveling repairman problem
- Approximation algorithms for the a priori traveling repairman
- Random sampling in cut, flow, and network design problems
- A priori TSP in the scenario model
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
- Network design via core detouring for problems without a core
- Deterministic Sampling Algorithms for Network Design
- Pseudorandomness for network algorithms
- A priori TSP in the Scenario Model
This page was built for publication: Deterministic sampling algorithms for network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547282)
