522 search results - page 1 / 105 » The 3-Steiner Root Problem |
WG
2007
Springer
14 years 5 months ago
2007
Springer
ICDT
2010
ACM
14 years 3 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
WETICE
1998
IEEE
14 years 3 months ago
1998
IEEE
Much work is going into securing the public key infrastructure (PKI). Various models for trust exist; Pretty Good Privacy (PGP) and the Progressive-Constraint Trust model are exam...
PPSN
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
COR
2008
13 years 10 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...