Imagen de Portada

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Bowen, Van Over, Brandon, Chong, Edwin K. P., Pezeshki, Ali
Formato:	Preprint
Publicado:	2024
Materias:	Systems and Control Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
por: Van Over, Brandon, et al.
Publicado: (2024)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

Greedy Dynamic Matching
por: Arnosti, Nick, et al.
Publicado: (2025)

Simple Construction of Greedy Trees and Greedy Permutations
por: Chubet, Oliver, et al.
Publicado: (2024)

New Greedy Spanners and Applications
por: Popova, Elizaveta, et al.
Publicado: (2026)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
por: Chen, Yixin, et al.
Publicado: (2026)

Greedy BST on Permutation Initial Tree
por: Pareek, Akash
Publicado: (2024)

From Dynamic Programs to Greedy Algorithms
por: van Melkebeek, Dieter
Publicado: (2025)

Lower Bounds for Greedy Teaching Set Constructions
por: Compton, Spencer, et al.
Publicado: (2025)

Engineering Algorithms for Dynamic Greedy Set Cover
por: Uzrad, Amitai
Publicado: (2026)

Greedy Completion for Weighted $(α,β)$-Spanners
por: Tzalik, Elad
Publicado: (2026)

An Improved Greedy Approximation for (Metric) $k$-Means
por: Charikar, Moses, et al.
Publicado: (2026)

Multiagent Matroid Upgrading: Greedy is Fair and Efficient
por: Ma, Qingwen, et al.
Publicado: (2026)

Greedy matroid base packings with applications to dynamic graph density and orientations
por: Arkhipov, Pavel, et al.
Publicado: (2025)

A Lossless Deamortization for Dynamic Greedy Set Cover
por: Solomon, Shay, et al.
Publicado: (2024)

Potential-Based Greedy Matching for Dynamic Delivery Pooling
por: Ma, Hongyao, et al.
Publicado: (2025)

The Power of Greedy for Online Minimum Cost Matching on the Line
por: Balkanski, Eric, et al.
Publicado: (2022)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
por: Chen, Wenjing, et al.
Publicado: (2023)

Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back
por: Manurangsi, Pasin
Publicado: (2024)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
por: Encz, Koppány István, et al.
Publicado: (2025)

Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
por: Nikolaev, Maksim
Publicado: (2024)

Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
por: Cáceres, Manuel, et al.
Publicado: (2025)

Discrete Effort Distribution via Regret-enabled Greedy Algorithm
por: Cao, Song, et al.
Publicado: (2025)

A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

A Simple Average-case Analysis of Recursive Randomized Greedy MIS
por: Dalirrooyfard, Mina, et al.
Publicado: (2026)

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

Efficient Greedy Discrete Subtrajectory Clustering
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
por: Shimoda, Takumi, et al.
Publicado: (2024)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
por: Ardizzoni, Stefano, et al.
Publicado: (2021)

Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
por: Riad, Md. Rawha Siddiqi, et al.
Publicado: (2025)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
por: Mitrović, Slobodan, et al.
Publicado: (2026)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
por: Harris, Blake, et al.
Publicado: (2024)

Adaptive control of dynamic networks
por: Pan, Chunyu, et al.
Publicado: (2023)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
por: Prakash, Rudra, et al.
Publicado: (2026)

Competitive Online Optimization under Inventory Constraints
por: Lin, Qiulin, et al.
Publicado: (2019)

Submodular Maximization under Supermodular Constraint: Greedy Guarantees
por: Srivastava, Ajitesh, et al.
Publicado: (2026)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
por: Eppstein, David
Publicado: (2025)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
por: Chaplick, Steven, et al.
Publicado: (2024)

Predict, Reposition, and Allocate: A Greedy and Flow-Based Architecture for Sustainable Urban Food Delivery
por: Makhdomi, Aqsa Ashraf, et al.
Publicado: (2025)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
por: la Tour, Max Dupré, et al.
Publicado: (2024)