20 results for “Iterated greedy algorithm”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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…
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…
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.
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.
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
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.
The paper provides improved bounds on the discrepancy of the online carpooling problem.
This paper improves max-policy iteration by replacing mathematical optimization with value iteration and proposes min-policy iteration as an alternative to linear programming.
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…
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…
The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.
This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.
This paper proposes a novel algorithm SME-OFU that improves the regret bound for stochastic linear contextual bandits with bounded reward noise.