- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds ; volume:76 ; number:4 ; day:19 ; month:1 ; year:2016 ; pages:1077-1096 ; date:12.2016
Algorithmica ; 76, Heft 4 (19.1.2016), 1077-1096, 12.2016
- Urheber
-
Bansal, Nikhil
- Beteiligte Personen und Organisationen
-
Oosterwijk, Tim
Vredeveld, Tjark
Zwaan, Ruben van der
SpringerLink (Online service)
- DOI
-
10.1007/s00453-016-0116-0
- URN
-
urn:nbn:de:1111-2016112611622
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:51 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
- Bansal, Nikhil
- Oosterwijk, Tim
- Vredeveld, Tjark
- Zwaan, Ruben van der
- SpringerLink (Online service)
Ähnliche Objekte (12)
Approximating Multistage Matching Problems
Approximating good simultaneous diophantine approximations is almost NP-hard
A Lower Bound for Scheduling Mechanisms
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints
A moment-matching method for approximating vector autoregressive processes by finite-state Markov chains
Random-Based Scheduling: New Approximations and LP Lower Bounds
Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs
Approximating Multistage Matching Problems
Approximating good simultaneous diophantine approximations is almost NP-hard
A Lower Bound for Scheduling Mechanisms
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints
A moment-matching method for approximating vector autoregressive processes by finite-state Markov chains
Random-Based Scheduling: New Approximations and LP Lower Bounds
Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs
Approximating Multistage Matching Problems
Approximating good simultaneous diophantine approximations is almost NP-hard
A Lower Bound for Scheduling Mechanisms
Approximating Perpetuities
Approximating data and statistical procedures. I. Approximating data
Approximating Data and Statistical Procedures - I. Approximating Data
Approximating Walrasian Equilibria
Approximating solution structure
Approximating least fixpoints
A moment-matching method for approximating vector autoregressive processes by finite-state Markov chains
Random-Based Scheduling: New Approximations and LP Lower Bounds