332 search results - page 60 / 67 » Parameterized Graph Separation Problems |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
SPAA
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
EOR
2008
13 years 7 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Successful multi-target tracking requires solving two problems - localize the targets and label their identity. An isolated target's identity can be unambiguously pr...