×

Found 927 Documents (Results 1–100)

Exact algorithms and hardness results for geometric red-blue hitting set problem. (English) Zbl 1528.68387

Li, Minming (ed.) et al., Frontiers of algorithmic wisdom. International joint conference, IJTCS-FAW 2022, Hong Kong, China, August 15–19, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13461, 176-191 (2023).
MSC:  68U05 68Q17 68W40
Full Text: DOI

Cover and hitting times of hyperbolic random graphs. (English) Zbl 07900614

Chakrabarti, Amit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX/RANDOM 2022, University of Illinois, Urbana-Champaign, USA, virtual conference, September 19–21, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 245, Article 30, 19 p. (2022).
MSC:  68W20 68W25 90C27

Computable bounds of exponential moments of simultaneous hitting time for two time-inhomogeneous atomic Markov chains. (English) Zbl 07819610

Malyarenko, Anatoliy (ed.) et al., Stochastic processes, statistical methods, and engineering mathematics. SPAS 2019, Västerås, Sweden, September 30 – October 2, 2019. Cham: Springer. Springer Proc. Math. Stat. 408, 97-119 (2022).
MSC:  60J10 60J20
Full Text: DOI

Filter Results by …

Access

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software