982 search results - page 111 / 197 » Solving Steiner tree problems in graphs to optimality |
124
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
99
Voted
ISCAS
2005
IEEE
15 years 6 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
105
click to vote
AAAI
2006
15 years 2 months ago
2006
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
100
Voted
CLOUDCOM
2010
Springer
14 years 10 months ago
2010
Springer
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...
89
Voted
ASPDAC
2008
ACM
15 years 2 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...