Suchergebnisse - "learning-augmented algorithms"

On Approximability of 𝓁₂² Min-Sum Clustering

Autoren: Karthik, C. S. Lee, Euiwoong Rabani, Yuval et al.

Weitere Verfasser: Karthik, C. S. Lee, Euiwoong Rabani, Yuval et al.

Quelle: Karthik, C S, Lee, E, Rabani, Y, Schwiegelshohn, C & Zhou, S 2025, On Approximability of l 2 2 Min-Sum Clustering. in O Aichholzer & H Wang (eds), 41st International Symposium on Computational Geometry, SoCG 2025., 62, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 332, 41st International Symposium on Computational Geometry, SoCG 2025, Kanazawa, Japan, 23/06/2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.62

Schlagwörter: hardness of approximation, polynomial-time approximation schemes, learning-augmented algorithms, ddc:004, Clustering

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.62

Robust machine-learned algorithms for efficient grid operation

Autoren: Nicolas Christianson Christopher Yeh Tongxin Li et al.

Quelle: Environmental Data Science, Vol 4 (2025)

Schlagwörter: Environmental sciences, online algorithms, machine learning robustness, Electronic computers. Computer science, GE1-350, learning-augmented algorithms, QA75.5-76.95, energy systems

Zugangs-URL: https://doaj.org/article/c17a1bade3b94dddaa053058ebd846e2

Learning-Augmented Priority Queues

Autoren: Benomar, Z Coester, C Benomar, Ziyad

Weitere Verfasser: Benomar, Z Coester, C Benomar, Ziyad

Schlagwörter: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Artificial Intelligence, Sorting, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Learning-augmented algorithms, Machine Learning (cs.LG), Shortest Path, Artificial Intelligence (cs.AI), Data structure, Computer Science - Data Structures and Algorithms, Priority queues, Data Structures and Algorithms (cs.DS), Complexity analysis

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2406.04793
https://hal.science/hal-04854076v1
https://ora.ox.ac.uk/objects/uuid:be3c227d-2479-4de7-ac58-e1cf766ee4a1

Learning-augmented approximation algorithms for maximum cut and related problems

Autoren: Cohen-Addad, Vincent D'Orsi, Tommaso Gupta, Anupam et al.

Schlagwörter: MAX-CUT, LEARNING AUGMENTED ALGORITHMS, LINEAR PROGRAMMING, CSPS

Zugangs-URL: https://openreview.net/forum?id=mirkQqx6po
https://hdl.handle.net/11565/4070016

On Dynamic Graph Algorithms with Predictions

Autoren: van den Brand, Jan Forster, Sebastian Nazari, Yasamin et al.

Quelle: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

Schlagwörter: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), DYNAMIC ALGORITHM, LEARNING-AUGMENTED ALGORITHMS, ALGORITHMS WITH PREDICTIONS, GRAPH ALGORITHMS, FINE-GRAINED COMPLEXITY, MATRIX MULTIPLICATION

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2307.09961

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT

Autoren: Dong, Yinhao Peng, Pan Vakilian, Ali et al.

Weitere Verfasser: Dong, Yinhao Peng, Pan Vakilian, Ali et al.

Schlagwörter: Graph Streaming Algorithms, FOS: Computer and information sciences, Learning-Augmented Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), MAX-CUT, ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2412.09773
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.44

Learning-augmented Maximum Independent Set

Autoren: Braverman, Vladimir Dharangutte, Prathamesh Shah, Vihan et al.

Weitere Verfasser: Braverman, Vladimir Dharangutte, Prathamesh Shah, Vihan et al.

Schlagwörter: graph algorithms, FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Learning-augmented algorithms, maximum independent set, Machine Learning (cs.LG)

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2407.11364
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.24

Online Bin Covering with Frequency Predictions

Autoren: Berg, Magnus Kamali, Shahin Magnus Berg and Shahin Kamali

Weitere Verfasser: Berg, Magnus Kamali, Shahin Magnus Berg and Shahin Kamali

Schlagwörter: Learning-Augmented Algorithms, Bin Covering, Computer Science - Data Structures and Algorithms, PAC Learning, ddc:004, Online Algorithms with Predictions

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2401.14881
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.10

Learning-Augmented Priority Queues

Autoren: Benomar, Ziyad Coester, Christian IA coopérative : équité, vie privée, incitations (FAIRPLAY) et al.

Weitere Verfasser: Benomar, Ziyad Coester, Christian IA coopérative : équité, vie privée, incitations (FAIRPLAY) et al.

Quelle: NeurIPS 2024 - 38th Conference on Neural Information Processing Systems ; https://hal.science/hal-04854076 ; NeurIPS 2024 - 38th Conference on Neural Information Processing Systems, Dec 2024, Vancouver (CA), Canada

Schlagwörter: Priority queues, Complexity analysis, Data structure, Learning-augmented algorithms, Sorting, Shortest Path, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Geographisches Schlagwort: Vancouver (CA)

Time: Vancouver (CA), Canada

Verfügbarkeit: https://hal.science/hal-04854076
https://hal.science/hal-04854076v1/document
https://hal.science/hal-04854076v1/file/2992_Learning_Augmented_Priori.pdf

Online k-Median with Consistent Clusters

Autoren: Moseley, Benjamin Newman, Heather Pruhs, Kirk et al.

Weitere Verfasser: Moseley, Benjamin Newman, Heather Pruhs, Kirk et al.

Schlagwörter: k-median, online algorithms, learning-augmented algorithms, beyond worst-case analysis

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.20

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.20
https://nbn-resolving.org/urn:nbn:de:0030-drops-210133
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.20

Online Time-Windows TSP with Predictions

Autoren: Chawla, Shuchi Christou, Dimitris Shuchi Chawla and Dimitris Christou

Weitere Verfasser: Chawla, Shuchi Christou, Dimitris Shuchi Chawla and Dimitris Christou

Schlagwörter: Travelling Salesman Problem, Predictions, Learning-Augmented Algorithms, Approximation

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.2

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.2
https://nbn-resolving.org/urn:nbn:de:0030-drops-209954
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.2

Learning-Augmented Energy-Aware List Scheduling for Precedence-Constrained Tasks

Autoren: Su, Yu Anand, Vivek Yu, Jannie et al.

Quelle: ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 9(4), 1-24, (2024-12)

Schlagwörter: Theory of computation, Scheduling algorithms, Computer systems organization, Cloud computing, Energy-Aware Scheduling, Precedence-Constrained Tasks, Learning-Augmented Algorithms

Relation: https://authors.library.caltech.edu/communities/caltechauthors/; https://doi.org/10.1145/3680278

Verfügbarkeit: https://doi.org/10.1145/3680278

Learning-augmented maximum flow

Autoren: Polak, Adam Zub, Maksym

Weitere Verfasser: Polak, Adam Zub, Maksym

Schlagwörter: GRAPH ALGORITHMS, MAXIMUM FLOW, FORD–FULKERSON, ALGORITHMS WITH PREDICTIONS, LEARNING-AUGMENTED ALGORITHMS

Dateibeschreibung: ELETTRONICO

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001253808800001; volume:186; firstpage:106487; lastpage:-; journal:INFORMATION PROCESSING LETTERS; https://hdl.handle.net/11565/4066596; https://www.sciencedirect.com/science/article/pii/S0020019024000176

Verfügbarkeit: https://hdl.handle.net/11565/4066596
https://doi.org/10.1016/j.ipl.2024.106487
https://www.sciencedirect.com/science/article/pii/S0020019024000176

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems

Autoren: Thắng, Nguyễn Kevi, Enikő Kevi, Eniko

Weitere Verfasser: Thắng, Nguyễn Kevi, Enikő Kevi, Eniko

Schlagwörter: online algorithm, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computer Science - Machine Learning, primal-dual, Computer Science - Computer Science and Game Theory, matching problems, Computer Science - Data Structures and Algorithms, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], learning-augmented algorithms, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], predictions, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2402.08701
https://hal.science/hal-03997203v1

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else

Autoren: Bampis, Evripidis Escoffier, Bruno Gouleakis, Themis et al.

Weitere Verfasser: Bampis, Evripidis Escoffier, Bruno Gouleakis, Themis et al.

Quelle: Leibniz International Proceedings in Informatics (LIPIcs), 274
31st Annual European Symposium on Algorithms (ESA 2023)

Schlagwörter: FOS: Computer and information sciences, Competitive analysis, Theory of computation → Design and analysis of algorithms, Online algorithms, TSP, Learning-augmented algorithms, Algorithms with predictions, [INFO] Computer Science [cs], Theory of computation → Online algorithms, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Dateibeschreibung: application/pdf; application/application/pdf

Zugangs-URL: http://arxiv.org/abs/2305.02169
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.12
https://hal.sorbonne-universite.fr/hal-04208875v1
https://doi.org/10.4230/lipics.esa.2023.12
http://hdl.handle.net/20.500.11850/637196

Online Time-Windows TSP with Predictions

Autoren: Chawla, Shuchi Christou, Dimitris Shuchi Chawla and Dimitris Christou

Weitere Verfasser: Chawla, Shuchi Christou, Dimitris Shuchi Chawla and Dimitris Christou

Schlagwörter: FOS: Computer and information sciences, Learning-Augmented Algorithms, Predictions, Computer Science - Data Structures and Algorithms, Travelling Salesman Problem, Data Structures and Algorithms (cs.DS), ddc:004, Approximation

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2304.01958
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.2

Online $k$-Median with Consistent Clusters

Autoren: Moseley, Benjamin Newman, Heather Pruhs, Kirk et al.

Weitere Verfasser: Moseley, Benjamin Newman, Heather Pruhs, Kirk et al.

Schlagwörter: k-median, FOS: Computer and information sciences, online algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), learning-augmented algorithms, ddc:004, beyond worst-case analysis

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2303.15379
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.20

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems

Autoren: Thắng, Nguyễn, Kim Kevi, Enikő Laboratoire d'Informatique de Grenoble (LIG) et al.

Weitere Verfasser: Thắng, Nguyễn, Kim Kevi, Enikő Laboratoire d'Informatique de Grenoble (LIG) et al.

Quelle: ALT 2023 - 34th International Conference on Algorithmic Learning Theory ; https://hal.science/hal-03997203 ; ALT 2023 - 34th International Conference on Algorithmic Learning Theory, Feb 2023, Singapore, Singapore. pp.1-18

Schlagwörter: online algorithm, predictions, matching problems, primal-dual, learning-augmented algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Geographisches Schlagwort: Singapore

Verfügbarkeit: https://hal.science/hal-03997203
https://hal.science/hal-03997203v1/document
https://hal.science/hal-03997203v1/file/ALT_2023.pdf

Warm Start Algorithms for Bipartite Matching and Optimal Transport

Autoren: Mittal, Akash Computer Science and#38 Applications et al.

Weitere Verfasser: Mittal, Akash Computer Science and#38 Applications et al.

Schlagwörter: Primal-Dual Method, Optimal Transport, Bipartite Matching, Learning Augmented Algorithms, Additive Approximation Algorithms

Dateibeschreibung: ETD; application/pdf

Zugangs-URL: https://hdl.handle.net/10919/124319

Online Conversion under Horizon Uncertainty: From Competitive Analysis to Learning-Augmented Algorithms

Autoren: Wang, Yanzhao

Schlagwörter: Competitive analysis, Resource allocation, Learning-augmented algorithms, Online decision making