153 search results - page 1 / 31 » Minimum cost subpartitions in graphs |
IPL
2007
13 years 5 months ago
2007
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
ISAAC
2010
Springer
13 years 3 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
MP
1998
13 years 4 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...