280 search results - page 19 / 56 » Distributed Approximation Algorithms for Planar Graphs |
171
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
134
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
140
click to vote
PPAM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
128
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
155
click to vote
MOBIHOC
2001
ACM
16 years 4 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...