FSTTCS
2010
Springer
13 years 10 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
MLQ
2008
14 years 12 days ago
2008
We study statements about countable and well ordered unions and how they are related to each other and to countable and well ordered forms of the axiom of choice.
DM
2008
14 years 16 days ago
2008
In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0, 1, . . . , n-1} exactly once such that the unions of any two consecutive k-subsets of...