Copertina

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Van Over, Brandon, Li, Bowen, Chong, Edwin K. P., Pezeshki, Ali
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Systems and Control Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
di: Li, Bowen, et al.
Pubblicazione: (2024)

Platoon Forming Algorithms for Intelligent Street Intersections
di: Timmerman, R. W., et al.
Pubblicazione: (2019)

Bounded Local Generator Classes for Deterministic State Evolution
di: Martin II, R. Jay
Pubblicazione: (2026)

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

Adaptive control of dynamic networks
di: Pan, Chunyu, et al.
Pubblicazione: (2023)

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

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
di: Li, Rao
Pubblicazione: (2024)

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

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

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
di: Alejandro-Soto, J. A., et al.
Pubblicazione: (2025)

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

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
di: Chen, Yike, et al.
Pubblicazione: (2024)

From Dynamic Programs to Greedy Algorithms
di: van Melkebeek, Dieter
Pubblicazione: (2025)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
di: Shi, Haoyan, et al.
Pubblicazione: (2024)

New Results on a General Class of Minimum Norm Optimization Problems
di: Chen, Kuowen, et al.
Pubblicazione: (2025)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
di: Su, Yuexin, et al.
Pubblicazione: (2026)

Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
di: Chakrabarti, Shouvanik, et al.
Pubblicazione: (2024)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
di: Fujiwara, Hiroshi, et al.
Pubblicazione: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
di: Housni, Omar El, et al.
Pubblicazione: (2024)

Engineering Algorithms for Dynamic Greedy Set Cover
di: Uzrad, Amitai
Pubblicazione: (2026)

Generalized Assignment and Knapsack Problems in the Random-Order Model
di: Klimm, Max, et al.
Pubblicazione: (2025)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
di: Sun, Shuo, et al.
Pubblicazione: (2024)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
di: Zhang, Yexin, et al.
Pubblicazione: (2024)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
di: Nguyen, Hue T., et al.
Pubblicazione: (2025)

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

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
di: Moeini, Mahdi, et al.
Pubblicazione: (2024)

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

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

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

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
di: Duvignau, Romaric, et al.
Pubblicazione: (2024)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
di: Chang, Claire, et al.
Pubblicazione: (2026)

Quantum Algorithm for the Multiple String Matching Problem
di: Khadiev, Kamil, et al.
Pubblicazione: (2024)

Learning-Augmented Algorithms for the Bahncard Problem
di: Zhao, Hailiang, et al.
Pubblicazione: (2024)

Online Smoothed Demand Management
di: Lechowicz, Adam, et al.
Pubblicazione: (2025)

Warehouse storage and retrieval optimization via clustering, dynamical systems modeling, and GPU-accelerated routing
di: Bengtsson, Magnus, et al.
Pubblicazione: (2025)

Optimum Noise Mechanism for Differentially Private Queries in Discrete Finite Sets
di: Kadam, Sachin, et al.
Pubblicazione: (2021)

High Probability Latency Sequential Change Detection over an Unknown Finite Horizon
di: Huang, Yu-Han, et al.
Pubblicazione: (2024)

Robust Dynamic Staffing with Predictions
di: Feng, Yiding, et al.
Pubblicazione: (2025)

Algorithms for Parameterized String Matching with Mismatches
di: Saha, Apurba, et al.
Pubblicazione: (2024)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
di: Besbes, Omar, et al.
Pubblicazione: (2022)