Sciweavers

2862 search results - page 57 / 573
» Bicriteria Network Design Problems
Sort
View
VTC
2010
IEEE
167views Communications» more  VTC 2010»
14 years 8 months ago
Pseudo Random Network Coding Design for IEEE 802.16m Enhanced Multicast and Broadcast Service
—Applying network coding on broadcasting service is known to reduce times of transmission in the process of recovering the loss packets. In previous design, coding coefficients ...
Cheng-Chih Chao, Ching-Chun Chou, Hung-Yu Wei
ORL
1998
136views more  ORL 1998»
14 years 9 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...
PPSN
2010
Springer
14 years 8 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
GLOBECOM
2007
IEEE
15 years 4 months ago
Designing Infrastructure-Based Overlay Networks for Delay-Sensitive Group Communications
— Infrastructure-based overlay networks have been proposed to support the quality of service requirements of a wide range of applications. In this paper, we study using infrastru...
Shaoyu Yang, Yoo-Ah Kim, Bing Wang
ICECCS
2002
IEEE
93views Hardware» more  ICECCS 2002»
15 years 2 months ago
Mnemosyne: Designing and Implementing Network Short-Term Memory
Network traffic logs play an important role in incident analysis. With the increasing throughput of network links, maintaining a complete log of all network activity has become a...
Giovanni Vigna, Andrew Mitchel