Sciweavers

11371 search results - page 51 / 2275
» The network inhibition problem
Sort
View
WICON
2008
14 years 11 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
15 years 4 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
APPROX
2004
Springer
116views Algorithms» more  APPROX 2004»
15 years 3 months ago
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Net
In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
IOR
2011
175views more  IOR 2011»
14 years 4 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
SAINT
2008
IEEE
15 years 4 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl