Sciweavers

237 search results - page 30 / 48
» Improved Approximations of Independent Sets in Bounded-Degre...
Sort
View
ICC
2007
IEEE
176views Communications» more  ICC 2007»
14 years 1 months ago
An Interference-Aware Channel Assignment Scheme for Wireless Mesh Networks
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
Arunabha Sen, Sudheendra Murthy, Samrat Ganguly, S...
FOCS
2009
IEEE
14 years 2 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
ICTAI
2010
IEEE
13 years 5 months ago
An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
Una Benlic, Jin-Kao Hao
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
14 years 2 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
COCOON
2009
Springer
14 years 2 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch