On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems: Approximation and Online Algorithms

On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems: Approximation and Online Algorithms

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 2006, Vol.361 (2-3), p.241-256
Hauptverfasser: UMA, R. N, WEIN, Joel, WILLIAMSON, David P
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Computer systems performance. Reliability
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Software
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:
ISSN:0304-3975
1879-2294