Approximation algorithms for stochastic k-TSP
From MaRDI portal
Approximation algorithms for stochastic \(k\)-TSP
Recommendations
- scientific article; zbMATH DE number 7053373
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- On the adaptivity gap of stochastic orienteering
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
Cites work
- A general approach for incremental approximation and hierarchical clustering
- A stochastic probing problem with applications
- Adaptive submodular ranking
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- Adaptivity and approximation for stochastic packing problems
- Adaptivity gaps for stochastic probing: submodular and XOS functions
- Approximating Matches Made in Heaven
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- scientific article; zbMATH DE number 2079396 (Why is no real title available?)
- Improved algorithms for orienteering and related problems
- Improved analysis of the greedy algorithm for stochastic matching
- Improved approximation algorithms for stochastic matching
- Improved approximation results for stochastic knapsack problems
- Improved bounds in stochastic matching and optimization
- Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
- Incremental medians via online bidding
- Maximum bipartite flow in networks with adaptive channel width
- Multi-armed Bandits with Metric Switching Costs
- On the adaptivity gap of stochastic orienteering
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs
- Scenario submodular cover
- Stochastic Covering and Adaptivity
- Submodular stochastic probing on matroids
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
Cited in
(8)- Non-adaptive stochastic score classification and explainable halfspace evaluation
- Approximation algorithms for optimal decision trees and adaptive TSP problems
- On the adaptivity gap of stochastic orienteering
- scientific article; zbMATH DE number 7053373 (Why is no real title available?)
- scientific article; zbMATH DE number 7650393 (Why is no real title available?)
- Probabilistic bounds on the k-traveling salesman problem and the traveling repairman problem
- Approximation algorithms for correlated knapsack orienteering
- Non-adaptive evaluation of k-of-n functions: tight gap and a unit-cost PTAS
This page was built for publication: Approximation algorithms for stochastic \(k\)-TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136319)
