Scheduling split intervals with non-uniform demands (Q2218651): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Values of the Interval Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interval number of a planar graph: Three intervals suffice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On double and multiple interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multidimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of sparse integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating \(k\)-set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mazing 2+<i>∊</i> Approximation for Unsplittable Flow on a Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-PTAS for unsplittable flow on line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the unsplittable flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for resource allocation under varying capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Algorithms for Packing Problems Allowing Overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of bandwidth trading / rank
 
Normal rank

Latest revision as of 08:02, 24 July 2024

scientific article
Language Label Description Also known as
English
Scheduling split intervals with non-uniform demands
scientific article

    Statements

    Scheduling split intervals with non-uniform demands (English)
    0 references
    0 references
    0 references
    0 references
    15 January 2021
    0 references
    approximation algorithms
    0 references
    randomized rounding
    0 references
    unsplittable flow problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers