841 search results - page 67 / 169 » Approximability of Minimum AND-Circuits |
128
Voted
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
147
click to vote
ADHOCNOW
2005
Springer
15 years 9 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
166
click to vote
FSTTCS
2001
Springer
15 years 8 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
148
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
139
click to vote
DAM
2010
15 years 4 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...