1272 search results - page 108 / 255 » The Set Cover with Pairs Problem |
132
Voted
PAIRING
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
142
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
AI
2007
Springer
15 years 27 days ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
100
click to vote
SIAMCOMP
2008
15 years 20 days ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
109
Voted
CANDC
2005
ACM
15 years 19 days ago
2005
ACM
Given an assembled genome of a diploid organism the haplotype assembly problem can be formulated as retrieval of a pair of haplotypes from a set of aligned weighted SNP fragments....