432 search results - page 15 / 87 » Minimum Weight Pseudo-Triangulations |
COMPGEOM
2003
ACM
14 years 23 days ago
2003
ACM
Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
IVC
2010
13 years 2 months ago
2010
Minimum cuts, extremum spanning forests and watersheds have been used as the basis for powerful image segmentation procedures. In this paper, we present some results about the lin...
FAW
2009
Springer
14 years 2 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— MaxWeight algorithm, a.k.a., back-pressure algorithm, has received much attention as a viable solution for dynamic link scheduling in multi-hop wireless networks. The b...