Related papers: The Fr\'echet Contingency Array Problem is Max-Plu…
The main purpose of this paper is to propose a variance-based Bregman extragradient algorithm with line search for solving stochastic variational inequalities, which is robust with respect an unknown Lipschitz constant. We prove the almost…
In this article we establish error bound for linear complementarity problem with $P$-matrix using plus function. We introduce a fundamental quantity associated with a $P$-matrix and show how this quantity is useful in deriving error bounds…
Lotteries are a prevalent form of gambling between a seller and buyers. Designing a lottery requires a model of how buyers make decisions when confronted with uncertain outcomes. Cumulative prospect theory (CPT) is a descriptive model that…
We show that the left/right relation on the set of s-t-paths of a plane graph induces a so-called submodular lattice. If the embedding of the graph is s-t-planar, this lattice is even consecutive. This implies that Ford and Fulkerson's…
The likelihood function of a finite mixture model is a non-convex function with multiple local maxima and commonly used iterative algorithms such as EM will converge to different solutions depending on initial conditions. In this paper we…
In this article, we consider the problem of estimating the parameters of the Fr\'echet distribution from both frequentist and Bayesian points of view. First we briefly describe different frequentist approaches, namely, maximum likelihood,…
The persistence probability is a statistical index that has been proposed to detect one or more communities embedded in a network. Even though its definition is straightforward, e.g, the probability that a random walker remains in a group…
For the classical maximum coverage problem, the greedy algorithm achieves a worst-case $1-1/e$ approximation, which is optimal unless $\text{P} = \text{NP}$. The notion of coverage appears in a wide range of optimization tasks, where…
We consider the problem of estimating the size of a maximum cut (Max-Cut problem) in a random Erd\H{o}s-R\'{e}nyi graph on $n$ nodes and $\lfloor cn \rfloor$ edges. It is shown in Coppersmith et al. ~\cite{Coppersmith2004} that the size of…
This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…
We prove the well-posedness of the Cauchy problem for the linear differential system of the form $x^{\prime}-A(t)x=f$, where $f$ is a distribution and $A$ possesses at most first-kind discontinuities together with all its derivatives…
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark…
In this paper we prove an infinite-dimensional version of Sard's theorem for Fr\'{e}chet manifolds. Let $ M $ and $ N $ be bounded Fr\'{e}chet manifolds such that the topologies of their model Fr\'{e}chet spaces are defined by metrics with…
The Column Subset Selection Problem provides a natural framework for unsupervised feature selection. Despite being a hard combinatorial optimization problem, there exist efficient algorithms that provide good approximations. The drawback of…
In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this article we present a modified greedy algorithm of…
Fr\'echet mean and variance provide a way of obtaining mean and variance for general metric space valued random variables and can be used for statistical analysis of data objects that lie in abstract spaces devoid of algebraic structure and…
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
In this paper, we study the redundancy of linear codes with graph constraints. First we consider linear parity check codes based on bipartite graphs with diversity and with generalized graph constraints. We describe sufficient conditions on…
In this work we study approximation algorithms for the \textit{Bounded Color Matching} problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge $e$ has a color $c_e$ and a profit $p_e \in…
The Fr\'echet distance is a popular distance measure for curves. We study the problem of clustering time series under the Fr\'echet distance. In particular, we give $(1+\varepsilon)$-approximation algorithms for variations of the following…