Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, Fred ...
Using the concept of Geometric Weakly Admissible Meshes (see §2 below) together with an algorithm based on the classical QR factorization of matrices, we compute efficient points...
Len Bos, Jean-Paul Calvi, Norman Levenberg, Alvise...
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...