2137 search results - page 92 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
117
Voted
CATS
2007
15 years 3 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
97
Voted
ALT
2009
Springer
15 years 11 months ago
2009
Springer
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
121
click to vote
EVOW
2004
Springer
15 years 7 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
127
click to vote
SODA
2007
ACM
15 years 3 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
134
Voted
SIAMCOMP
2000
15 years 1 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...