Xiangshuang Liu

BIP Revisited: Enabling Efficient Dominance Pruning for Distributed Constraint Optimization

Bound-Independent Pruning (BIP) is a powerful technique for accelerating tree-based complete search algorithms for Distributed Constraint Optimization Problems (DCOPs) by pruning dominated regions of the search space using only local information. However, BIP fundamentally relies on constructing a c