scientific article; zbMATH DE number 7278054
From MaRDI portal
Publication:5136269
DOI10.4230/LIPIcs.ISAAC.2017.49zbMath1457.68309arXiv1708.00143MaRDI QIDQ5136269
Rajmohan Rajaraman, Hamidreza Jahanjou, Erez Kantor
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1708.00143
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resource allocation with time intervals
- Primal-dual approximation algorithms for integral flow and multicut in trees
- An improved algorithm for online coloring of intervals with bandwidth
- Scheduling jobs with fixed start and end times
- A quasi-PTAS for unsplittable flow on line graphs
- Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
- Coloring and Maximum Independent Set of Rectangles
- An improved approximation algorithm for resource allocation
- On a Coloring Problem.
- The Linearity of First-Fit Coloring of Interval Graphs
- Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path
- The Temporal Knapsack Problem and Its Solution
- A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
- A logarithmic approximation for unsplittable flow on line graphs
- Automata, Languages and Programming
- A unified approach to approximating resource allocation and scheduling
- Approximation and Online Algorithms
- Online Capacitated Interval Coloring
This page was built for publication:
