15254 search results - page 3 / 3051 » A k |
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
CATS
1998
13 years 7 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
FOCS
2010
IEEE
13 years 4 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
ITICSE
2006
ACM
14 years 5 days ago
2006
ACM
Teaching computer science to children is a major priority in most countries in the world. Nevertheless, Computer Science curricula do not seem to address the children’s world, c...
IPCO
2001
13 years 7 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...