- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
A Lower Bound for Scheduling Mechanisms ; volume:55 ; number:4 ; day:24 ; month:1 ; year:2008 ; pages:729-740 ; date:12.2009
Algorithmica ; 55, Heft 4 (24.1.2008), 729-740, 12.2009
- Urheber
-
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-008-9165-3
- URN
-
urn:nbn:de:101:1-2021081511513030487440
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 14.08.2025, 10:46 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Christodoulou, George
- Koutsoupias, Elias
- Vidali, Angelina
- SpringerLink (Online service)
Ähnliche Objekte (12)
Lower bounds for project scheduling problems with renewable and cumulative resources
Improved lower bounds for the proportional lot sizing and scheduling problem
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
Random-Based Scheduling: New Approximations and LP Lower Bounds
Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
A Lower Bound on Computational Complexity Given by Revelation Mechanisms
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
Lower bounds for project scheduling problems with renewable and cumulative resources
Improved lower bounds for the proportional lot sizing and scheduling problem
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
Random-Based Scheduling: New Approximations and LP Lower Bounds
Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
A Lower Bound on Computational Complexity Given by Revelation Mechanisms
Lower bounds for Auslander's representation dimension
Resolution Lower Bounds for Refutation Statements
Lower bounds for project scheduling problems with renewable and cumulative resources
Improved lower bounds for the proportional lot sizing and scheduling problem
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
Random-Based Scheduling: New Approximations and LP Lower Bounds
Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Lower Bound Functions for Polynomials
Lower Bounds for Heuristic Algorithms
A Lower Bound on Computational Complexity Given by Revelation Mechanisms
Lower bounds for Auslander's representation dimension