2137 search results - page 92 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
141
click to vote
CATS
2007
15 years 6 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...
118
click to vote
ALT
2009
Springer
16 years 1 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...
148
click to vote
EVOW
2004
Springer
15 years 10 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 ...
151
click to vote
SODA
2007
ACM
15 years 6 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...
153
click to vote
SIAMCOMP
2000
15 years 4 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...