Online and offline algorithms for the sorting buffers problem on the line metric (Q2266935): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.jda.2008.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120305839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting locality: Approximating sorting buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Capacitated Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Online Algorithms for the Sorting Buffer Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dial a Ride from k-Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411413 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:32, 2 July 2024

scientific article
Language Label Description Also known as
English
Online and offline algorithms for the sorting buffers problem on the line metric
scientific article

    Statements

    Online and offline algorithms for the sorting buffers problem on the line metric (English)
    0 references
    0 references
    0 references
    26 February 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    online algorithms
    0 references
    metric embedding
    0 references
    0 references