2137 search results - page 114 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
161
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
126
click to vote
JAIR
1998
15 years 4 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
109
Voted
DAM
2006
15 years 4 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
137
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
152
click to vote
SIGMETRICS
2010
ACM
15 years 3 months ago
2010
ACM
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...