895 search results - page 14 / 179 » Using graphs for some discrete tomography problems |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
KDD
2010
ACM
13 years 5 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
HPCN
1995
Springer
13 years 11 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
FUIN
2000
13 years 7 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...