2503 search results - page 252 / 501 » A study of 3-arc graphs |
166
click to vote
PODC
2005
ACM
16 years 4 days 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...
156
click to vote
SMA
2005
ACM
16 years 4 days ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
171
click to vote
SPAA
2005
ACM
16 years 4 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
167
click to vote
ICN
2005
Springer
16 years 2 days ago
2005
Springer
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classi...
171
click to vote
WEA
2005
Springer
16 years 1 days ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...