- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Exact and approximation algorithms for covering timeline in temporal graphs ; day:26 ; month:4 ; year:2024 ; pages:1-20
Annals of operations research ; (26.4.2024), 1-20
- Urheber
-
Dondi, Riccardo
Popa, Alexandru
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10479-024-05993-8
- URN
-
urn:nbn:de:101:1-2407092111447.343188412069
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:45 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
- Dondi, Riccardo
- Popa, Alexandru
- SpringerLink (Online service)
Ähnliche Objekte (12)
On optimality of exact and approximation algorithms for scheduling problems
Exact and approximation algorithms for many-visits travelling salesperson problems
The Near Exact Bin Covering Problem
Minimum genus and maximum planar subgraph : exact genus and maximum planar subgraph : exact algorithms and general limits of approximation algorithms
Exact exponential algorithms
Optimal distributed covering algorithms
Approximation algorithms
Approximation Algorithms
Approximation Algorithms
On Derandomized Approximation Algorithms
Combinatorial Algorithms for Covering and Scheduling Problems
Exact algorithms for constraint satisfaction problems
On optimality of exact and approximation algorithms for scheduling problems
Exact and approximation algorithms for many-visits travelling salesperson problems
The Near Exact Bin Covering Problem
Minimum genus and maximum planar subgraph : exact genus and maximum planar subgraph : exact algorithms and general limits of approximation algorithms
Exact exponential algorithms
Optimal distributed covering algorithms
Approximation algorithms
Approximation Algorithms
Approximation Algorithms
On Derandomized Approximation Algorithms
Combinatorial Algorithms for Covering and Scheduling Problems
Exact algorithms for constraint satisfaction problems
On optimality of exact and approximation algorithms for scheduling problems
Exact and approximation algorithms for many-visits travelling salesperson problems
The Near Exact Bin Covering Problem
Minimum genus and maximum planar subgraph : exact genus and maximum planar subgraph : exact algorithms and general limits of approximation algorithms
Exact exponential algorithms
Optimal distributed covering algorithms
Approximation algorithms
Approximation Algorithms
Approximation Algorithms
On Derandomized Approximation Algorithms
Combinatorial Algorithms for Covering and Scheduling Problems