Sciweavers

2862 search results - page 73 / 573
» Bicriteria Network Design Problems
Sort
View
FSTTCS
2009
Springer
15 years 4 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
PPSN
2000
Springer
15 years 1 months ago
A Hybrid GA for the Edge-Biconnectivity Augmentation Problem
In the design of communication networks, robustness against failures in single links or nodes is an important issue. This paper proposes a new approach for the NP-complete edge-bic...
Ivana Ljubic, Günther R. Raidl, Jozef Kratica
TPDS
2002
126views more  TPDS 2002»
14 years 9 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
ICAC
2006
IEEE
15 years 4 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
BIOWIRE
2007
Springer
15 years 4 months ago
A Circulatory System Approach for Wireless Sensor Networks
Abstract—One of the challenges in a military wireless sensor network is the determination of an information collection infrastructure which minimizes battery power consumption. T...
Vasileios Pappas, Dinesh Verma, Ananthram Swami