Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
Abstract-- We consider the problem of two transmitters wishing to exchange information through a relay in the middle. The channels between the transmitters and the relay are assume...
Makesh Pravin Wilson, Krishna R. Narayanan, Henry ...
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
Shuchi Chawla, Jason D. Hartline, Robert Kleinberg