Pages that link to "Item:Q5895231"
From MaRDI portal
The following pages link to A unified approach to approximating resource allocation and scheduling (Q5895231):
Displayed 50 items.
- Dynamic resource allocation: a flexible and tractable modeling framework (Q299823) (← links)
- Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Distributed approximation of cellular coverage (Q433421) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Improving LTL truck load utilization on line (Q531465) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- Primal-dual schema for capacitated covering problems (Q747765) (← links)
- Real time scheduling with a budget: parametric-search is better than binary search (Q845717) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- The tool switching problem revisited (Q881565) (← links)
- Exploiting locality: Approximating sorting buffers (Q925070) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
- A truthful mechanism for value-based scheduling in cloud computing (Q1678764) (← links)
- Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
- Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- Online file caching with rejection penalties (Q2346958) (← links)
- Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143) (← links)
- Optimizing bandwidth allocation in elastic optical networks with application to scheduling (Q2407946) (← links)
- General caching is hard: even with small pages (Q2408914) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Approximations for generalized unsplittable flow on paths with application to power systems optimization (Q2678593) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- Fixed-parameter algorithms for unsplittable flow cover (Q2701069) (← links)
- Pricing on Paths: A PTAS for the Highway Problem (Q2796210) (← links)
- The Prize-collecting Call Control Problem on Weighted Lines and Rings (Q2798111) (← links)
- On Tree-Constrained Matchings and Generalizations (Q3012795) (← links)
- On Variants of File Caching (Q3012805) (← links)
- On Capacitated Set Cover Problems (Q3088080) (← links)
- Scheduling Resources for Throughput Maximization (Q3088087) (← links)
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems (Q3088089) (← links)