Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382): Difference between revisions

@@ Property / cites work @@
+Q3640530
@@ Property / cites work: Q3640530 / rank @@
+Normal rank
@@ Property / cites work @@
+A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
+Normal rank
@@ Property / cites work @@
+Q5754462
@@ Property / cites work: Q5754462 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+Strong price of anarchy
@@ Property / cites work: Strong price of anarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Strong Equilibrium in Job Scheduling Games
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3597151
@@ Property / cites work: Q3597151 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Results for Multiprocessor Scheduling under Resource Constraints
+Normal rank
@@ Property / cites work @@
+An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
+Normal rank
@@ Property / cites work @@
+Mathematical analysis II. Transl. from the 4th Russian edition by Roger Cooke
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank