Results 61 to 70 of about 1,078 (84)

A technique for obtaining true approximations for k-center with covering constraints. [PDF]

Math Program, 2022
Anegg G, Angelidakis H, Kurpisz A, Zenklusen R.   +3 more
europepmc   +1 more source

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]

Algorithmica, 2021
Novotná J, Okrasa K, Pilipczuk M, Rzążewski P, van Leeuwen EJ, Walczak B.   +5 more
europepmc   +1 more source

Discrete coalescent trees. [PDF]

J Math Biol, 2021
Collienne L, Collienne L, Elmes K, Fischer M, Bryant D, Gavryushkin A.   +5 more
europepmc   +1 more source

The Convex Mixture Distribution: Granger Causality for Categorical Time Series. [PDF]

SIAM J Math Data Sci, 2021
Tank A, Li X, Fox EB, Shojaie A.
europepmc   +1 more source

Lower error bounds and optimality of approximation for jump-diffusion SDEs with discontinuous drift. [PDF]

BIT Numer Math
Przybyłowicz P, Schwarz V, Szölgyenyi M.   +2 more
europepmc   +1 more source

Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid. [PDF]

Math Program
Santiago R, Sergeev I, Zenklusen R.
europepmc   +1 more source

A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]

Math Program
Çela E, Klinz B, Lendl S, Woeginger GJ, Wulf L.   +4 more
europepmc   +1 more source

Automated tight Lyapunov analysis for first-order methods. [PDF]

Math Program
Upadhyaya M, Banert S, Taylor AB, Giselsson P.   +3 more
europepmc   +1 more source

Advances on strictly Δ -modular IPs. [PDF]

Math Program
Nägele M, Nöbel C, Santiago R, Zenklusen R.   +3 more
europepmc   +1 more source

On the Convergence Analysis of the Optimized Gradient Method. [PDF]

J Optim Theory Appl, 2017
Kim D, Fessler JA.
europepmc   +1 more source