Online selection of intervals and \(t\)-intervals (Q391644): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6244348 / rank
 
Normal rank
Property / zbMATH Keywords
 
interval selection
Property / zbMATH Keywords: interval selection / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithms
Property / zbMATH Keywords: online algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive analysis
Property / zbMATH Keywords: competitive analysis / 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.1016/j.ic.2013.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977737452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using fractional primal-dual to schedule split intervals with demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems in multiple-interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online independent sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Power of Preemption in Randomized Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved randomized results for the interval selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved randomized on-line algorithm for a weighted interval selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3950561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of an interval scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval selection: Applications, algorithms, and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for on-line graph coloring / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:53, 7 July 2024

scientific article
Language Label Description Also known as
English
Online selection of intervals and \(t\)-intervals
scientific article

    Statements

    Online selection of intervals and \(t\)-intervals (English)
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    interval selection
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references

    Identifiers