388 search results - page 16 / 78 » An approximate algorithm for median graph computation using ... |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
FOCS
2002
IEEE
14 years 22 days ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...