401 search results - page 2 / 81 » Algorithms for a Simple Point Placement Problem |
INFOCOM
2008
IEEE
14 years 19 days ago
2008
IEEE
Abstract— Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user populations. As the network usage grows, network...
IJCGA
2002
13 years 6 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
SODA
1996
ACM
13 years 7 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
ISPD
2007
ACM
13 years 7 months ago
2007
ACM
Traditionally, research in global placement has focused on relatively few simple metrics, such as pure wirelength or routability estimates. However, in the real world today, desig...
PAAPP
1998
13 years 5 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...