51 search results - page 3 / 11 » The Packing Property |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
SODA
2001
ACM
13 years 8 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
ISAAC
2005
Springer
14 years 28 days ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
SIAMDM
1998
13 years 7 months ago
1998
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
ICANNGA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The purpose of this work is to demonstrate that it is possible to cluster contact maps for pairs of alpha helices such that each of the clusters corresponds to a group of...