195 search results - page 30 / 39 » A polynomial algorithm for the p-centdian problem on a tree |
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
SODA
1990
ACM
13 years 8 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
IPPS
2003
IEEE
14 years 29 days ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
STOC
2005
ACM
14 years 1 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...