ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Iterated greedy algorithm”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NEEmpiricalRecentJun 13, 2026

Large Language Model-Driven Cooperative Operator Ensemble Evolution for Permutation Flow Shop Scheduling

Rui Xu, Yufan Liao, Haoze Lv, Shengcai Liu +2 more

This paper proposes a new iterated greedy algorithm with a multi-operator approach and a large language model-assisted framework to enhance exploration and improve performance on the permutation flow…

View →
cs.DSTheoreticalRecentJun 26, 2026

Incremental Submodular Maximization: Better Than Greedy

Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa +2 more

The paper presents an adaptive scaling algorithm with a competitive ratio of 1.373 for incremental submodular maximization under increasing cardinality constraint, improving upon the previous best res…

View →
cs.DSTheoreticalRecentAug 5, 2026

The Greedy Binary Search Tree is Non-trivially Competitive

Yuhao Guo, Seth Pettie, Daniel Skora, Chengzhang Wan

This paper proves the competitiveness of Greedy binary search tree as 2^(O(sqrt(loglog n))), improving upon the widely held belief of O(1)-competitiveness.

View →
cs.DScs.CCTheoreticalRecentJul 16, 2026

Semi-Streaming Matching in a Single Pass II: Greedy is Optimal

Sepehr Assadi, Max Jiang, Mars Xiang

This paper proves that no single-pass semi-streaming algorithm can achieve a better-than-half approximation to the maximum matching problem, implying the optimality of the naive greedy algorithm.

View →
cs.DSTheoreticalRecentOct 19, 2026

A Tight Oracle Threshold for \(k\)-Submodular Maximization

Siyuan Chen

The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.

View →
cs.DScs.DCTheoreticalRecentOct 13, 2026

No Truly Sublogarithmic-Round Algorithm for Distributed MIS in the LOCAL Model

Seri Khoury, Aaron Schild

This paper proves a lower bound for the number of rounds required to find a maximal independent set in a graph using a randomized LOCAL algorithm.

View →
cs.DSTheoreticalRecentSep 18, 2026

The Cube-Root Phenomenon in Online Carpooling

Nikhil Bansal, Milind Prabhu, Sahil Singla, Siddharth M. Sundaram

The paper provides improved bounds on the discrepancy of the online carpooling problem.

View →
cs.PLmath.OCTheoreticalRecentJun 9, 2026

Max-Policy Iteration, Revisited

David Monniaux, Helmut Seidl

This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.

View →
cs.LGcs.AIRecentMay 29, 2026

Annealed Softmax Greedy in Many-Armed Bayesian Bandits

William Overman, Mohsen Bayati

The paper analyzes the performance of an annealed softmax policy in a Bayesian bandit setting, proving that under specific prior conditions, it achieves near-optimal regret rates by effectively sampli…

View →
cs.DSTheoreticalRecentJun 25, 2026

Incremental Dominating Set

Ilan Doron Arad, Jonathan Gal, Seffi Naor

This paper presents deterministic and randomized algorithms for the incremental dominating set problem in vertex-weighted graphs, achieving competitive ratios of O(Δ) and O(log^2Δ) respectively. It al…

View →
cs.DScs.CCcs.DMTheoreticalRecentJul 20, 2026

On the Impact of Stability and the Helly Property on the Dominating Set Problem

Che Cheng, Daniel Mock, Peter Rossmanith

The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.

View →
cs.DSTheoreticalRecentJul 17, 2026

A Unified Theory of Sparsification

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

View →
stat.MLcs.LGmath.OCEmpiricalRecentJun 18, 2026

Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach

Haonan Xu, Yingying Li

This paper proposes a novel algorithm SME-OFU that improves the regret bound for stochastic linear contextual bandits with bounded reward noise.

View →