A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
From MaRDI portal
Publication:3503857
DOI10.1007/978-3-540-68891-4_23zbMath1143.90383MaRDI QIDQ3503857
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_23
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68W25: Approximation algorithms
Related Items
Designing Networks with Good Equilibria under Uncertainty, Deterministic sampling algorithms for network design, The A priori traveling repairman problem, A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands, Designing cost-sharing methods for Bayesian games, A priori TSP in the scenario model, Approximation algorithms for the a priori traveling repairman, Designing Cost-Sharing Methods for Bayesian Games, On the Complexity of Master Problems, A priori TSP in the Scenario Model, Routing Under Uncertainty: The a priori Traveling Repairman Problem