Two approximation algorithms for solving the min–max heterogeneous weighted delivery problem

Approximation algorithms for solving the constrained strong Steiner connectivity augmentation problem

Greedy approximation for the minimum (1, m)-connected dominating set with labeling

An FPT approximation algorithm for the partition set cover problem with penalties

Exact algorithms for solving the constrained convex combinatorial assignment problems with bounds and maximum penalty

Minimum power partial cover meets fairness: improved approximation guarantees

Gumbel Convergence for Maximal Packing Distances from Uniform Random Samples

Let (Xn)n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(X_n)_n$$\end{document} be a sequence of i.i.d. Rd\documentclass[12pt]{minimal} \...