65 search results - page 2 / 13 » Maximum Marking Problems with Accumulative Weight Functions |
CIAC
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
ICGA
1993
13 years 6 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...