Computing and Combinatorics

DOI10.1007/B99243zbMath1091.90509OpenAlexW2491887524MaRDI QIDQ4681180

Fabien Baille, Christian Laforest, Evripidis Bampis

Publication date: 15 June 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99243

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (2)

Faster and simpler approximation algorithms for mixed packing and covering problems ⋮ Bicriteria scheduling for contiguous and non contiguous parallel tasks

This page was built for publication: Computing and Combinatorics