2137 search results - page 63 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
NETWORKS
2006
13 years 8 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
AAIM
2005
Springer
14 years 2 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
NIPS
2007
13 years 10 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
ECRTS
2006
IEEE
14 years 2 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...