- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
The Near Exact Bin Covering Problem ; day:19 ; month:3 ; year:2024 ; pages:1-26
Algorithmica ; (19.3.2024), 1-26
- Creator
-
Levin, Asaf
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-024-01224-5
- URN
-
urn:nbn:de:101:1-2405211141274.792833457994
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 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
- Levin, Asaf
- SpringerLink (Online service)
Other Objects (12)
Exact and approximation algorithms for covering timeline in temporal graphs
On rectangular covering problems
The bin covering with delivery problem, extended investigations for the online case
On semi-online machine scheduling and generalized bin covering
On semi-online machine scheduling and generalized bin covering
Set Covering Probleme in der Funknetzplanung
Set Covering Probleme in der Funknetzplanung
Exact four colorability, exact domatic number problems, and the boolean hierarchy
Gradual Covering Location Problem with Stochastic Radius
The complexity of the covering radius problem
Combinatorial Algorithms for Covering and Scheduling Problems
Convex Optimization Techniques for Geometric Covering Problems
Exact and approximation algorithms for covering timeline in temporal graphs
On rectangular covering problems
The bin covering with delivery problem, extended investigations for the online case
On semi-online machine scheduling and generalized bin covering
On semi-online machine scheduling and generalized bin covering
Set Covering Probleme in der Funknetzplanung
Set Covering Probleme in der Funknetzplanung
Exact four colorability, exact domatic number problems, and the boolean hierarchy
Gradual Covering Location Problem with Stochastic Radius
The complexity of the covering radius problem
Combinatorial Algorithms for Covering and Scheduling Problems
Convex Optimization Techniques for Geometric Covering Problems
Exact and approximation algorithms for covering timeline in temporal graphs
On rectangular covering problems
The bin covering with delivery problem, extended investigations for the online case
On semi-online machine scheduling and generalized bin covering
On semi-online machine scheduling and generalized bin covering
Set Covering Probleme in der Funknetzplanung
Set Covering Probleme in der Funknetzplanung
Exact four colorability, exact domatic number problems, and the boolean hierarchy
Gradual Covering Location Problem with Stochastic Radius
The complexity of the covering radius problem
Combinatorial Algorithms for Covering and Scheduling Problems