1951 search results - page 274 / 391 » An algorithm for improving graph partitions |
132
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon an improved...
139
click to vote
FOCS
2008
IEEE
15 years 11 months 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...
136
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
152
click to vote
EPS
1998
Springer
15 years 8 months ago
1998
Springer
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
115
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...