- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
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
- Creator
-
Dondi, Riccardo
Popa, Alexandru
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10479-024-05993-8
- URN
-
urn:nbn:de:101:1-2407092111447.343188412069
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:45 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
- Dondi, Riccardo
- Popa, Alexandru
- SpringerLink (Online service)
Other Objects (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