Scheduling with conflicts: Online and offline algorithms (Q842559): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-008-0089-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013937449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the decomposition of graphs into isomorphic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum Multicoloring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of graph partition problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with incompatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>OPT</i>Versus<i>LOAD</i>in Dynamic Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling File Transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks -- An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bin Packing with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multiprocessor Scheduling with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloring trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with conflicts on bipartite and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for bin packing with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion scheduling problem for permutation and comparability graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for general multiprocessor job shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The χt-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Parallel Machines On-Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 00:27, 2 July 2024

scientific article
Language Label Description Also known as
English
Scheduling with conflicts: Online and offline algorithms
scientific article

    Statements

    Scheduling with conflicts: Online and offline algorithms (English)
    0 references
    0 references
    0 references
    0 references
    25 September 2009
    0 references
    0 references
    scheduling with conflicts
    0 references
    mutual exclusion scheduling
    0 references
    approximation algorithms
    0 references
    online algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references