Scheduling with gaps: new models and algorithms (Q2059088): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Tak-Wah Lam / rank
Normal rank
 
Property / author
 
Property / author: Tak-Wah Lam / rank
 
Normal rank
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-021-00691-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3186047907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit tasks to minimize the number of idle periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Time Algorithms for Minimum Energy Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for minimum energy scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the one-dimensional \(k\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation algorithm for minimum-gap scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Approximation Algorithm for Minimum-Gap Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined algorithms for hitting many intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize gaps and power consumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity bounds for location problems on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disjoint cliques problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection in \(X+Y\) and matrices with sorted rows and columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monge strikes again: Optimal placement of web proxies in the internet / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:46, 27 July 2024

scientific article
Language Label Description Also known as
English
Scheduling with gaps: new models and algorithms
scientific article

    Statements

    Scheduling with gaps: new models and algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 December 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references