2137 search results - page 255 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
206
click to vote
SPAA
1999
ACM
15 years 10 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
174
click to vote
EMMCVPR
2001
Springer
15 years 10 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
166
Voted
FOCS
2008
IEEE
16 years 23 days ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
145
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: There has been recent concern regarding the inability of predictive modeling approaches to generalize to new data. Some of the problems can be attributed to improper m...
194
click to vote
KAIS
2011
15 years 1 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...