First O(n^{2-1/(2h-2)} polylog n) algorithm for diameter and eccentricity in real-weighted K_h-minor-free digraphs via randomized search-to-decision reduction on VC-dimension.
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics , booktitle =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.
In the dueling bandit setting, the (1+1) EA selects the Condorcet winner with only constant probability when its advantage is Ω(1/n), while a Max-Min Ant System EDA selects it with probability 1-Θ(p), and repeated duels improve the EA's performance.
citing papers explorer
-
Real-weighted Diameter and Eccentricity of Minor-free and Bounded VC-dimension Graphs in Truly Subquadratic Time
First O(n^{2-1/(2h-2)} polylog n) algorithm for diameter and eccentricity in real-weighted K_h-minor-free digraphs via randomized search-to-decision reduction on VC-dimension.
-
Temporal Conductance and Bounds on the Voter Model for Dynamic Networks
Defines temporal conductance Φ for dynamic networks and proves the voter model consensus time is O(m/(d_min Φ)) with a tight lower bound.
-
Analysis of Search Heuristics in the Multi-Armed Bandit Setting
In the dueling bandit setting, the (1+1) EA selects the Condorcet winner with only constant probability when its advantage is Ω(1/n), while a Max-Min Ant System EDA selects it with probability 1-Θ(p), and repeated duels improve the EA's performance.