New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
Algorithmica · 2024-09 · 86 (9) · 2997-3026
DOI: 10.1007/s00453-024-01252-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithmica, online erschienen am 18.07.2024. Verfasst von Spencer Compton und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 23 Literaturangaben. Gefördert von: National Defense Science and Engineering Graduate, National Science Foundation, FinTech@CSAIL.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Defense Science and Engineering Graduate
- National Science Foundation
- FinTech@CSAIL
- National Science Foundation TRIPODS
Zitieren
APA
Compton, S., Mitrović, S., & Rubinfeld, R. (2024). New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. Algorithmica, 86(9), 2997-3026. https://doi.org/10.1007/s00453-024-01252-1
Vancouver
Compton S, Mitrović S, Rubinfeld R. New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. Algorithmica. 2024;86(9):2997-3026. doi:10.1007/s00453-024-01252-1
BibTeX
@article{Compton2024,
author = {Compton, Spencer and Mitrović, Slobodan and Rubinfeld, Ronitt},
title = {New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling},
journal = {Algorithmica},
year = {2024},
volume = {86},
number = {9},
pages = {2997--3026},
doi = {10.1007/s00453-024-01252-1}
}
EUVIMED