A priori TSP in the Scenario Model (Q2971168): Difference between revisions

@@ Property / cites work @@
+A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Deterministic sampling algorithms for network design
+Normal rank
@@ Property / cites work @@
+Algorithms for the universal and a priori TSP
@@ Property / cites work: Algorithms for the universal and a priori TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower and upper bounds for universal TSP in planar metrics
+Normal rank
@@ Property / cites work @@
+Improved Lower Bounds for the Universal and a priori TSP
+Normal rank
@@ Property / cites work @@
+Q5501328
@@ Property / cites work: Q5501328 / rank @@
+Normal rank
@@ Property / cites work @@
+Hedging uncertainty: approximation algorithms for stochastic optimization problems
+Normal rank
@@ Property / cites work @@
+Q5351897
@@ Property / cites work: Q5351897 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling over Scenarios on Two Machines
@@ Property / cites work: Scheduling over Scenarios on Two Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Sometimes Travelling is Easy: The Master Tour Problem
+Normal rank
@@ Property / cites work @@
+On the Complexity of Master Problems
@@ Property / cites work: On the Complexity of Master Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250161
@@ Property / cites work: Q4250161 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
+Normal rank
@@ Property / cites work @@
+Cyclic ordering is NP-complete
@@ Property / cites work: Cyclic ordering is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941635
@@ Property / cites work: Q2941635 / rank @@
+Normal rank
@@ Property / cites work @@
+On the probabilistic min spanning tree problem
@@ Property / cites work: On the probabilistic min spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank