On lazy bureaucrat scheduling with common deadlines (Q2427440): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The lazy bureaucrat scheduling problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms and Data Structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An approximation algorithm for the maximum traveling salesman problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3046476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On approximating the longest path in a graph / rank | |||
Normal rank |
Latest revision as of 09:44, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On lazy bureaucrat scheduling with common deadlines |
scientific article |
Statements
On lazy bureaucrat scheduling with common deadlines (English)
0 references
13 May 2008
0 references
scheduling
0 references
approximation scheme
0 references
NP-hardness
0 references
0 references