Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Abstract. We describe a two-level push-relabel algorithm for the maximum flow problem and compare it to the competing codes. The algorithm generalizes a practical algorithm for bi...
. This paper aims at proposing a global view of the interoperability problem, independently of any domain. We first describe explicitly the problem, and the context in which it app...
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Inferential problems that arise in the empirical analysis oftreatmentresponseinduceambiguityabouttheidentity of optimal treatment rules. This paper describes a research program th...