2137 search results - page 108 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
137
click to vote
AIPS
2008
15 years 7 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
132
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
137
click to vote
COMBINATORICS
2007
15 years 4 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
153
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
147
click to vote
IJCAI
1989
15 years 6 months ago
1989
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...