Sciweavers

370 search results - page 11 / 74
» Independent Sets with Domination Constraints
Sort
View
ICDCS
2008
IEEE
14 years 1 months ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 2 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
SDM
2008
SIAM
122views Data Mining» more  SDM 2008»
13 years 8 months ago
Type-Independent Correction of Sample Selection Bias via Structural Discovery and Re-balancing
Sample selection bias is a common problem in many real world applications, where training data are obtained under realistic constraints that make them follow a different distribut...
Jiangtao Ren, Xiaoxiao Shi, Wei Fan, Philip S. Yu
IWPEC
2009
Springer
14 years 1 months ago
Boolean-Width of Graphs
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
CP
2001
Springer
13 years 12 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli