455 search results - page 73 / 91 » Approximation Algorithms for Partial Covering Problems |
ESA
2006
Springer
15 years 1 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Cell selection is the process of determining the cell(s) that provide service to each mobile station. Optimizing these processes is an important step towards maximizing the util...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
MASCOTS
2010
14 years 11 months ago
2010
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...