Copertina

Strengths and Limitations of Greedy in Cup Games

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Jasińska, Kalina, Kuszmaul, John, Lee, Gyudong
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms 68W40 F.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Computing and Enumerating Minimal Common Supersequences Between Two Strings
di: Sopp, Braeden, et al.
Pubblicazione: (2026)

Naively Sorting Evolving Data is Optimal and Robust
di: Giakkoupis, George, et al.
Pubblicazione: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
di: Shigemizu, Mika, et al.
Pubblicazione: (2018)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
di: Friggstad, Zachary, et al.
Pubblicazione: (2018)

Building a Nest by an Automaton
di: Czyzowicz, Jurek, et al.
Pubblicazione: (2019)

Strongly Sublinear Algorithms for Testing Pattern Freeness
di: Newman, Ilan, et al.
Pubblicazione: (2021)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
di: An, Hyung-Chan, et al.
Pubblicazione: (2025)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

Maximizing Diversity in (near-)Median String Selection
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2026)

String 2-Covers with No Length Restrictions
di: Boneh, Itai, et al.
Pubblicazione: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
di: Nezhad, Sina Ghasemi, et al.
Pubblicazione: (2024)

Minimum-cost paths for electric cars
di: Dorfman, Dani, et al.
Pubblicazione: (2024)

Hairpin Completion Distance Lower Bound
di: Boneh, Itai, et al.
Pubblicazione: (2024)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
di: Filmus, Yuval, et al.
Pubblicazione: (2024)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
di: Crochemore, Maxime, et al.
Pubblicazione: (2025)

PPSZ is better than you think
di: Scheder, Dominik
Pubblicazione: (2022)

NP-membership for the boundary-boundary art-gallery problem
di: Stade, Jack
Pubblicazione: (2025)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
di: Shlyk, Vasiliy S.
Pubblicazione: (2026)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
di: Grobben, Kobe, et al.
Pubblicazione: (2025)

The Distributional Tail of Worst-Case Quickselect
di: Płecha, Witold
Pubblicazione: (2026)

Stochastic Function Certification with Correlations
di: Ghuge, Rohan, et al.
Pubblicazione: (2026)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
di: Gupta, Swati, et al.
Pubblicazione: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
di: Gupta, Swati, et al.
Pubblicazione: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
di: Borodin, Allan, et al.
Pubblicazione: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
di: Gupta, Swati, et al.
Pubblicazione: (2023)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
di: Hommelsheim, Felix
Pubblicazione: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2023)

Incremental-Decremental Maximization
di: Disser, Yann, et al.
Pubblicazione: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
di: Bubeck, Sébastien, et al.
Pubblicazione: (2022)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
di: Gu, Qian-Ping, et al.
Pubblicazione: (2025)

A $5/4$-Approximation for Two-Edge Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2024)

Convergence of the QuickVal Residual
di: Fill, James Allen, et al.
Pubblicazione: (2024)

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
di: AmaniHamedani, Alireza, et al.
Pubblicazione: (2024)

The Power of Filling in Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2022)

Mean-Biased Processes for Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2023)