Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748): Difference between revisions

@@ Property / author @@
-Q463370
@@ Property / author: Q463370 / rank @@
-Normal rank
@@ Property / author @@
-Katherine Neznakhina
@@ Property / author: Katherine Neznakhina / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C22
@@ Property / Mathematics Subject Classification ID: 05C22 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6474473
@@ Property / zbMATH DE Number: 6474473 / rank @@
+Normal rank
@@ Property / author @@
+Mikhail Yu. Khachay
@@ Property / author: Mikhail Yu. Khachay / rank @@
+Normal rank
@@ Property / author @@
+Katherine Neznakhina
@@ Property / author: Katherine Neznakhina / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
+Normal rank
@@ Property / cites work @@
+On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
+Normal rank
@@ Property / cites work @@
+Q3115183
@@ Property / cites work: Q3115183 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Quad trees: A data structure for retrieval by composite keys
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1064562415020313
+Normal rank
@@ Property / OpenAlex ID @@
+W766530756
@@ Property / OpenAlex ID: W766530756 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:492748