Publication:4737537
From MaRDI portal
zbMath1049.90025MaRDI QIDQ4737537
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370329.htm
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Approximate strong separation with application in fractional graph coloring and preemptive scheduling., An approximation algorithm for the general max-min resource sharing problem