632 search results - page 33 / 127 » On the Approximability of the Steiner Tree Problem |
APPROX
2000
Springer
14 years 1 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
JNCA
2011
12 years 11 months ago
2011
Recently, several studies have been conducted to design mobility‐based multicast routing protocols for wireless mobile ad hoc networks (MANET). These ...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
ISPD
2010
ACM
14 years 3 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
ISPD
2003
ACM
14 years 2 months ago
2003
ACM
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...