1632 search results - page 18 / 327 » On special numberings of hypergraphs |
156
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
263
click to vote
DC
2011
14 years 6 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
152
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Problems of secure communication and computation have been studied extensively in network models, for example, Franklin and Yung have studied secure communications in the...
191
click to vote
ISAAC
2009
Springer
16 years 21 days ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
185
click to vote
PPDP
2009
Springer
16 years 21 days ago
2009
Springer
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...