Improved algorithms for resource allocation under varying capacity (Q1617284): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-017-0515-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2588949834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Unsplittable Flow on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path / 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: A logarithmic approximation for unsplittable flow on line graphs / 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: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-phase algorithms for throughput maximization for real-time 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: Q2908848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for scheduling on line and tree networks / 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: Q4633902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity demand flow in a tree and packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957504 / 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: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast primal-dual distributed algorithms for scheduling and matching problems / 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: Elimination graphs / rank
 
Normal rank

Latest revision as of 07:44, 17 July 2024

scientific article
Language Label Description Also known as
English
Improved algorithms for resource allocation under varying capacity
scientific article

    Statements

    Improved algorithms for resource allocation under varying capacity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    unsplittable flow problem
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references