- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Bansal, Nikhil
- Contributor
-
Oosterwijk, Tim
Vredeveld, Tjark
Zwaan, Ruben van der
SpringerLink (Online service)
- DOI
-
10.1007/s00453-016-0116-0
- URN
-
urn:nbn:de:1111-2016112611622
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:51 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bansal, Nikhil
- Oosterwijk, Tim
- Vredeveld, Tjark
- Zwaan, Ruben van der
- SpringerLink (Online service)
Other Objects (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