Deterministic algorithms for multi-criteria max-TSP (Q713324): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2012.05.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2094749368
@@ Property / OpenAlex ID: W2094749368 / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
+Normal rank
@@ Property / cites work @@
+Q5417632
@@ Property / cites work: Q5417632 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Approximating maximum weight cycle covers in directed graphs with weights zero and one
+Normal rank
@@ Property / cites work @@
+Approximating Multi-criteria Max-TSP
@@ Property / cites work: Approximating Multi-criteria Max-TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Multicriteria Optimization
@@ Property / cites work: Multicriteria Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
+Normal rank
@@ Property / cites work @@
+Approximability and Hardness in Multi-objective Optimization
+Normal rank
@@ Property / cites work @@
+Applications of Discrepancy Theory in Multiobjective Approximation
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
+Normal rank
@@ Property / cites work @@
+Multi-criteria TSP: Min and Max combined
@@ Property / cites work: Multi-criteria TSP: Min and Max combined / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating multicriteria TSP
@@ Property / cites work: On approximating multicriteria TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for multi-criteria traveling salesman problems
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank