791 search results - page 21 / 159 » Approximating the Maximum Sharing Problem |
156
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—This paper addresses the joint selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference...
123
Voted
AMC
2005
15 years 2 months ago
2005
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
127
Voted
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
138
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
133
Voted
CPM
2000
Springer
15 years 7 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...