402 search results - page 61 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
TON
2002
13 years 7 months ago
2002
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
SYNASC
2005
IEEE
14 years 27 days ago
2005
IEEE
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
IJCAI
2007
13 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...