:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Moseley, Benjamin, Pruhs, Kirk, Stein, Clifford, Zhou, Rudy
Format:	Preprint
Publié:	2021
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2111.06564
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Robust Gittins for Stochastic Scheduling
par: Moseley, Benjamin, et autres
Publié: (2025)

Competitive Online Transportation Simplified
par: Arndt, Stephen, et autres
Publié: (2025)

Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard
par: Moseley, Benjamin, et autres
Publié: (2026)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
par: Im, Sungjin, et autres
Publié: (2025)

Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota's Basis Conjecture
par: Arndt, Stephen, et autres
Publié: (2026)

Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
par: Arndt, Stephen, et autres
Publié: (2025)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
par: Im, Sungjin, et autres
Publié: (2023)

An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
par: Arndt, Stephen, et autres
Publié: (2026)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
par: Armbruster, Alexander, et autres
Publié: (2026)

Indirect Coflow Scheduling
par: Lindermayr, Alexander, et autres
Publié: (2025)

Faster Global Minimum Cut with Predictions
par: Moseley, Benjamin, et autres
Publié: (2025)

Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs
par: Moseley, Benjamin, et autres
Publié: (2024)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
par: Kawase, Yasushi, et autres
Publié: (2025)

Drawing Competitive Districts in Redistricting
par: Chuang, Gabriel, et autres
Publié: (2024)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
par: Ganz, Amit, et autres
Publié: (2023)

Incremental Topological Ordering and Cycle Detection with Predictions
par: McCauley, Samuel, et autres
Publié: (2024)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
par: Davies, Sami, et autres
Publié: (2023)

An Optimal Algorithm for Stochastic Vertex Cover
par: Brand, Jan van den, et autres
Publié: (2026)

Submodular Max-Min Allocation under Identical Valuations
par: Boehmer, Kimon
Publié: (2026)

The Power of Migrations in Dynamic Bin Packing
par: Mellou, Konstantina, et autres
Publié: (2024)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
par: Krishnaswamy, Ravishankar, et autres
Publié: (2014)

A Competitive Algorithm for Agnostic Active Learning
par: Price, Eric, et autres
Publié: (2023)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
par: Dufay, Marc, et autres
Publié: (2025)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
par: Chen, Wenjing, et autres
Publié: (2023)

Real Time Proportional Throughput Maximization: How much advance notice should you give your scheduler?
par: Mottu, Nadim A.
Publié: (2025)

Improved Algorithms for Fair Matroid Submodular Maximization
par: Mahabadi, Sepideh, et autres
Publié: (2026)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
par: Kalavas, Andreas, et autres
Publié: (2025)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
par: Cervenjak, Philip, et autres
Publié: (2026)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
par: Chuzhoy, Julia, et autres
Publié: (2026)

Weighted $k$-Server Admits an Exponentially Competitive Algorithm
par: Bijoy, Adithya, et autres
Publié: (2025)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
par: Zhu, Yanhui, et autres
Publié: (2024)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
par: Wan, Zongqi, et autres
Publié: (2024)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
par: Cervenjak, Philip, et autres
Publié: (2023)

Waiting is worth it and can be improved with predictions
par: Liang, Ya-Chun, et autres
Publié: (2025)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
par: Davies, Sami, et autres
Publié: (2025)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
par: Clifford, Peter, et autres
Publié: (2026)

A Simple Algorithm for Dynamic Carpooling with Recourse
par: Efron, Yuval, et autres
Publié: (2024)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
par: Basiak, Mateusz, et autres
Publié: (2025)

Detection of Common Subtrees with Identical Label Distribution
par: Azaïs, Romain, et autres
Publié: (2023)