Sciweavers

41 search results - page 7 / 9
» Approximate Integer Decompositions for Undirected Network De...
Sort
View
IPCO
2001
79views Optimization» more  IPCO 2001»
13 years 7 months ago
Synthesis of 2-Commodity Flow Networks
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
Refael Hassin, Asaf Levin
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 7 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 6 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
ESSMAC
2003
Springer
13 years 11 months ago
Joint Optimization of Wireless Communication and Networked Control Systems
Abstract. We consider a linear system, such as an estimator or a controller, in which several signals are transmitted over wireless communication channels. With the coding and medi...
Lin Xiao, Mikael Johansson, Haitham A. Hindi, Step...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 6 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner