5 search results - page 1 / 1 » Lift and project relaxations for the matching and related po... |
DAM
2004
13 years 10 months ago
2004
MP
2006
13 years 10 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
ANOR
2005
13 years 10 months ago
2005
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
CVPR
2008
IEEE
15 years 25 days ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
PKC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...