7129 search results - page 517 / 1426 » Approximation Algorithms for Treewidth |
165
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
193
click to vote
NIPS
1998
15 years 8 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
165
click to vote
DM
2008
15 years 7 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
192
click to vote
IPL
2006
15 years 7 months ago
2006
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
166
click to vote
CPC
2007
15 years 7 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...