scientific article; zbMATH DE number 1759466
From MaRDI portal
Publication:4536419
zbMath0998.68021MaRDI QIDQ4536419
Nodari Vakhania, Evgeny V. Shchepin
Publication date: 25 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (4)
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs ⋮ On the complexity of constructing multiprocessor little-preemptive schedules ⋮ An optimal rounding gives a better approximation for scheduling unrelated machines ⋮ An absolute approximation algorithm for scheduling unrelated machines
This page was built for publication:
