Approximation schemes for a class of subset selection problems (Q2381527): Difference between revisions

@@ Property / author @@
-Q547301
@@ Property / author: Q547301 / rank @@
-Normal rank
@@ Property / author @@
-Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / rank @@
-Normal rank
@@ Property / author @@
+Kirk R. Pruhs
@@ Property / author: Kirk R. Pruhs / rank @@
+Normal rank
@@ Property / author @@
+Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2165102171
@@ Property / OpenAlex ID: W2165102171 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292915
@@ Property / cites work: Q3292915 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved FPTAS for Restricted Shortest Path.
@@ Property / cites work: An improved FPTAS for Restricted Shortest Path. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast approximation algorithm for job sequencing with deadlines
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for the Restricted Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Algorithms for Scheduling Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
+Normal rank
@@ Property / cites work @@
+Q3995531
@@ Property / cites work: Q3995531 / rank @@
+Normal rank
@@ Property / cites work @@
+A Functional Equation and its Application to Resource Allocation and Sequencing Problems
+Normal rank
@@ Property / cites work @@
+A simple efficient approximation scheme for the restricted shortest path problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling Independent Tasks
@@ Property / cites work: Algorithms for Scheduling Independent Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2381527