Strengths and Limitations of Greedy in Cup Games
Fuente:
arXiv
Saved in:
| Main Authors: | Jasińska, Kalina, Kuszmaul, John, Lee, Gyudong |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)
by: Sopp, Braeden, et al.
Published: (2026)
Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)
by: Giakkoupis, George, et al.
Published: (2024)
Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)
by: Chen, Zongchen, et al.
Published: (2022)
Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
by: Shigemizu, Mika, et al.
Published: (2018)
by: Shigemizu, Mika, et al.
Published: (2018)
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)
by: Friggstad, Zachary, et al.
Published: (2018)
Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)
by: Czyzowicz, Jurek, et al.
Published: (2019)
Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)
by: Newman, Ilan, et al.
Published: (2021)
A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)
by: Hougardy, Stefan, et al.
Published: (2025)
Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
by: An, Hyung-Chan, et al.
Published: (2025)
by: An, Hyung-Chan, et al.
Published: (2025)
How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)
by: Maslen, David K., et al.
Published: (2025)
On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)
by: Zhong, Xianghui
Published: (2019)
On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)
by: DasGupta, Bhaskar, et al.
Published: (2026)
On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)
by: Balkanski, Eric, et al.
Published: (2026)
Maximizing Diversity in (near-)Median String Selection
by: Chakraborty, Diptarka, et al.
Published: (2026)
by: Chakraborty, Diptarka, et al.
Published: (2026)
String 2-Covers with No Length Restrictions
by: Boneh, Itai, et al.
Published: (2024)
by: Boneh, Itai, et al.
Published: (2024)
Fast FPT Algorithms for Grundy Number on Dense Graphs
by: Nezhad, Sina Ghasemi, et al.
Published: (2024)
by: Nezhad, Sina Ghasemi, et al.
Published: (2024)
Minimum-cost paths for electric cars
by: Dorfman, Dani, et al.
Published: (2024)
by: Dorfman, Dani, et al.
Published: (2024)
Hairpin Completion Distance Lower Bound
by: Boneh, Itai, et al.
Published: (2024)
by: Boneh, Itai, et al.
Published: (2024)
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
by: Filmus, Yuval, et al.
Published: (2024)
by: Filmus, Yuval, et al.
Published: (2024)
25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
by: Crochemore, Maxime, et al.
Published: (2025)
by: Crochemore, Maxime, et al.
Published: (2025)
PPSZ is better than you think
by: Scheder, Dominik
Published: (2022)
by: Scheder, Dominik
Published: (2022)
NP-membership for the boundary-boundary art-gallery problem
by: Stade, Jack
Published: (2025)
by: Stade, Jack
Published: (2025)
CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
by: Shlyk, Vasiliy S.
Published: (2026)
by: Shlyk, Vasiliy S.
Published: (2026)
Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)
by: Grobben, Kobe, et al.
Published: (2025)
The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)
by: Płecha, Witold
Published: (2026)
Stochastic Function Certification with Correlations
by: Ghuge, Rohan, et al.
Published: (2026)
by: Ghuge, Rohan, et al.
Published: (2026)
Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
by: Gupta, Swati, et al.
Published: (2022)
by: Gupta, Swati, et al.
Published: (2022)
Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
by: Gupta, Swati, et al.
Published: (2025)
by: Gupta, Swati, et al.
Published: (2025)
Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
by: Borodin, Allan, et al.
Published: (2025)
by: Borodin, Allan, et al.
Published: (2025)
Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
by: Gupta, Swati, et al.
Published: (2023)
by: Gupta, Swati, et al.
Published: (2023)
Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)
by: Hommelsheim, Felix
Published: (2025)
A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)
by: Bosch-Calvo, Miguel, et al.
Published: (2023)
Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)
by: Disser, Yann, et al.
Published: (2025)
Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)
by: Bubeck, Sébastien, et al.
Published: (2022)
Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
by: Gu, Qian-Ping, et al.
Published: (2025)
by: Gu, Qian-Ping, et al.
Published: (2025)
A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)
by: Bosch-Calvo, Miguel, et al.
Published: (2024)
Convergence of the QuickVal Residual
by: Fill, James Allen, et al.
Published: (2024)
by: Fill, James Allen, et al.
Published: (2024)
Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
by: AmaniHamedani, Alireza, et al.
Published: (2024)
by: AmaniHamedani, Alireza, et al.
Published: (2024)
The Power of Filling in Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2022)
by: Los, Dimitrios, et al.
Published: (2022)
Mean-Biased Processes for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)
by: Los, Dimitrios, et al.
Published: (2023)
Similar Items
-
Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026) -
Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024) -
Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022) -
Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
by: Shigemizu, Mika, et al.
Published: (2018) -
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)