Primal-dual approximation algorithms for a packing-covering pair of problems (Q3148377): Difference between revisions

@@ Property / DOI @@
-.1051/ro:2002005
@@ Property / DOI: 10.1051/ro:2002005 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2163145578
@@ Property / OpenAlex ID: W2163145578 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Throughput of Multiple Machines in Real-Time Scheduling
+Normal rank
@@ Property / cites work @@
+A unified approach to approximating resource allocation and scheduling
+Normal rank
@@ Property / cites work @@
+Multi-phase algorithms for throughput maximization for real-time scheduling
+Normal rank
@@ Property / cites work @@
+Q4472496
@@ Property / cites work: Q4472496 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of an interval scheduling problem
+Normal rank
@@ Property / DOI @@
+.1051/RO:2002005
@@ Property / DOI: 10.1051/RO:2002005 / rank @@
+Normal rank