1998 search results - page 109 / 400 » Complexity of the Cover Polynomial |
ALDT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
ECSQARU
2009
Springer
14 years 4 months ago
2009
Springer
Partially preordered belief bases are very convenient for an efficient representation of incomplete knowledge. They offer flexibility and avoid to compare unrelated pieces of inf...
TARK
2009
Springer
14 years 4 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...