195 search results - page 19 / 39 » A polynomial algorithm for the p-centdian problem on a tree |
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
SIAMDM
2010
13 years 2 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
TCBB
2010
2010
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
13 years 2 months ago
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
INFOCOM
2002
IEEE
14 years 19 days ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...