On lazy bureaucrat scheduling with common deadlines (Q2427440): Difference between revisions

@@ Property / author @@
-Guo-Chuan Zhang
@@ Property / author: Guo-Chuan Zhang / rank @@
-Normal rank
@@ Property / author @@
+Guo-Chuan Zhang
@@ Property / author: Guo-Chuan Zhang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-007-9076-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1968033609
@@ Property / OpenAlex ID: W1968033609 / rank @@
+Normal rank
@@ Property / cites work @@
+The lazy bureaucrat scheduling problem
@@ Property / cites work: The lazy bureaucrat scheduling problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the maximum traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q3046476
@@ Property / cites work: Q3046476 / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2427440