2137 search results - page 62 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
127
click to vote
KDD
2010
ACM
15 years 19 days ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
132
Voted
CSCLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
172
Voted
WG
2004
Springer
15 years 7 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
96
Voted
DAGSTUHL
2007
15 years 3 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
126
Voted
ISPD
2010
ACM
15 years 9 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...