Sciweavers

523 search results - page 72 / 105
» Improved Approximation Algorithms for Maximum Graph Partitio...
Sort
View
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 2 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
FOCS
2006
IEEE
14 years 2 months ago
A simple condition implying rapid mixing of single-site dynamics on spin systems
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
Thomas P. Hayes
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
14 years 3 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
13 years 7 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
GIS
2003
ACM
14 years 2 months ago
Construction of the planar partition postal code map based on cadastral reGIStration
Accurate postal code maps have many applications within GIS as the postal code has the potential to link the address description of buildings to their location in a specified glob...
Friso Penninga, Edward Verbree, Wilko Quak, Peter ...