From Dynamic Programs to Greedy Algorithms
Fuente:
arXiv
Saved in:
| Main Author: | van Melkebeek, Dieter |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees
by: Hu, Ivan, et al.
Published: (2022)
by: Hu, Ivan, et al.
Published: (2022)
Engineering Algorithms for Dynamic Greedy Set Cover
by: Uzrad, Amitai
Published: (2026)
by: Uzrad, Amitai
Published: (2026)
Greedy Dynamic Matching
by: Arnosti, Nick, et al.
Published: (2025)
by: Arnosti, Nick, et al.
Published: (2025)
A Threshold Greedy Algorithm for Noisy Submodular Maximization
by: Chen, Wenjing, et al.
Published: (2023)
by: Chen, Wenjing, et al.
Published: (2023)
Discrete Effort Distribution via Regret-enabled Greedy Algorithm
by: Cao, Song, et al.
Published: (2025)
by: Cao, Song, et al.
Published: (2025)
A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
by: Derakhshan, Mahsa, et al.
Published: (2026)
by: Derakhshan, Mahsa, et al.
Published: (2026)
Potential-Based Greedy Matching for Dynamic Delivery Pooling
by: Ma, Hongyao, et al.
Published: (2025)
by: Ma, Hongyao, et al.
Published: (2025)
A Lossless Deamortization for Dynamic Greedy Set Cover
by: Solomon, Shay, et al.
Published: (2024)
by: Solomon, Shay, et al.
Published: (2024)
An Improved Greedy Approximation for (Metric) $k$-Means
by: Charikar, Moses, et al.
Published: (2026)
by: Charikar, Moses, et al.
Published: (2026)
Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
by: Mitrović, Slobodan, et al.
Published: (2026)
by: Mitrović, Slobodan, et al.
Published: (2026)
Greedy Algorithms for Shortcut Sets and Hopsets
by: Bals, Ben, et al.
Published: (2025)
by: Bals, Ben, et al.
Published: (2025)
From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
by: Großmann, Ernestine, et al.
Published: (2025)
by: Großmann, Ernestine, et al.
Published: (2025)
Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
by: Chaplick, Steven, et al.
Published: (2024)
by: Chaplick, Steven, et al.
Published: (2024)
New Greedy Spanners and Applications
by: Popova, Elizaveta, et al.
Published: (2026)
by: Popova, Elizaveta, et al.
Published: (2026)
Greedy BST on Permutation Initial Tree
by: Pareek, Akash
Published: (2024)
by: Pareek, Akash
Published: (2024)
Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)
Greedy Completion for Weighted $(α,β)$-Spanners
by: Tzalik, Elad
Published: (2026)
by: Tzalik, Elad
Published: (2026)
Multiagent Matroid Upgrading: Greedy is Fair and Efficient
by: Ma, Qingwen, et al.
Published: (2026)
by: Ma, Qingwen, et al.
Published: (2026)
Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
by: Nguyen, Hue T., et al.
Published: (2025)
by: Nguyen, Hue T., et al.
Published: (2025)
Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
by: la Tour, Max Dupré, et al.
Published: (2024)
by: la Tour, Max Dupré, et al.
Published: (2024)
Efficient Greedy Discrete Subtrajectory Clustering
by: van der Hoog, Ivor, et al.
Published: (2025)
by: van der Hoog, Ivor, et al.
Published: (2025)
The Power of Greedy for Online Minimum Cost Matching on the Line
by: Balkanski, Eric, et al.
Published: (2022)
by: Balkanski, Eric, et al.
Published: (2022)
Simple Construction of Greedy Trees and Greedy Permutations
by: Chubet, Oliver, et al.
Published: (2024)
by: Chubet, Oliver, et al.
Published: (2024)
Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
by: Cáceres, Manuel, et al.
Published: (2025)
by: Cáceres, Manuel, et al.
Published: (2025)
Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
by: Nikolaev, Maksim
Published: (2024)
by: Nikolaev, Maksim
Published: (2024)
Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
by: Duvignau, Romaric, et al.
Published: (2024)
by: Duvignau, Romaric, et al.
Published: (2024)
Greedy matroid base packings with applications to dynamic graph density and orientations
by: Arkhipov, Pavel, et al.
Published: (2025)
by: Arkhipov, Pavel, et al.
Published: (2025)
A Simple Average-case Analysis of Recursive Randomized Greedy MIS
by: Dalirrooyfard, Mina, et al.
Published: (2026)
by: Dalirrooyfard, Mina, et al.
Published: (2026)
On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
by: Li, Bowen, et al.
Published: (2024)
by: Li, Bowen, et al.
Published: (2024)
Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
by: Slivkins, Aleksandrs, et al.
Published: (2025)
by: Slivkins, Aleksandrs, et al.
Published: (2025)
Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
by: Riad, Md. Rawha Siddiqi, et al.
Published: (2025)
by: Riad, Md. Rawha Siddiqi, et al.
Published: (2025)
A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
by: Van Over, Brandon, et al.
Published: (2024)
by: Van Over, Brandon, et al.
Published: (2024)
Space-Efficient Algorithm for Integer Programming with Few Constraints
by: Rohwedder, Lars, et al.
Published: (2024)
by: Rohwedder, Lars, et al.
Published: (2024)
Predict, Reposition, and Allocate: A Greedy and Flow-Based Architecture for Sustainable Urban Food Delivery
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2025)
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2025)
Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
by: Caroppo, Susanna, et al.
Published: (2025)
by: Caroppo, Susanna, et al.
Published: (2025)
Randomized Rounding over Dynamic Programs
by: Bamas, Etienne, et al.
Published: (2025)
by: Bamas, Etienne, et al.
Published: (2025)
Fully Dynamic Algorithms for Chamfer Distance
by: Goranci, Gramoz, et al.
Published: (2025)
by: Goranci, Gramoz, et al.
Published: (2025)
Fully Dynamic Algorithms for Transitive Reduction
by: Goranci, Gramoz, et al.
Published: (2025)
by: Goranci, Gramoz, et al.
Published: (2025)
Smoothed Analysis of Dynamic Graph Algorithms
by: Meir, Uri, et al.
Published: (2025)
by: Meir, Uri, et al.
Published: (2025)
The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
by: Chen, Yeyuan
Published: (2024)
by: Chen, Yeyuan
Published: (2024)
Similar Items
-
Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees
by: Hu, Ivan, et al.
Published: (2022) -
Engineering Algorithms for Dynamic Greedy Set Cover
by: Uzrad, Amitai
Published: (2026) -
Greedy Dynamic Matching
by: Arnosti, Nick, et al.
Published: (2025) -
A Threshold Greedy Algorithm for Noisy Submodular Maximization
by: Chen, Wenjing, et al.
Published: (2023) -
Discrete Effort Distribution via Regret-enabled Greedy Algorithm
by: Cao, Song, et al.
Published: (2025)