500 search results - page 22 / 100 » Approximation algorithms for maximum independent set of pseu... |
111
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
173
click to vote
SIGECOM
2011
ACM
14 years 4 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
111
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
109
click to vote
FAW
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
119
click to vote
JCP
2006
15 years 1 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...