Sciweavers

367 search results - page 6 / 74
» Set connectivity problems in undirected graphs and the direc...
Sort
View
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 5 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 1 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
CPAIOR
2008
Springer
13 years 9 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
COCOON
2004
Springer
14 years 22 days ago
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
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...
Yong Zhang, Hong Zhu
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
13 years 5 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan