scientific article; zbMATH DE number 5764783

MaRDI QIDQ3579372zbMATHFDO

Authors Tomáš Ebenlendr, Marek Krčál, Jiří Sgall

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Parallel algorithms in computer science (68W10)

Cited in

(19)

• Scheduling and fixed-parameter tractability
• A note on graph balancing problems with restrictions
• Scheduling jobs with release and delivery times subject to nested eligibility constraints
• A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
• Santa Claus Meets Hypergraph Matchings
• Parallel machine scheduling with nested job assignment restrictions
• Graph balancing: a special case of scheduling unrelated parallel machines
• Lazy local search meets machine scheduling
• On the configuration LP for maximum budgeted allocation
• Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
• Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
• Bounding the running time of algorithms for scheduling and packing problems
• Graph balancing with orientation costs
• Makespan minimization on unrelated parallel machines with a few bags
• On the configuration-LP for scheduling on unrelated machines
• A 3/2-approximation algorithm for the graph balancing problem with two weights
• Unrelated parallel machine scheduling -- perspectives and progress
• Approximation algorithms for the graph balancing problem with two speeds and two job lengths
• Structured instances of restricted assignment with two processing times

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579372)