#### Filter Results:

#### Publication Year

1983

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Gabriel Robins, Alex Zelikovsky
- SODA
- 2000

The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-time heuristic with an approximation ratio approaching 1 + ln 3 2 1:55, which improves upon the previously best-known approximation algorithm of 10] with performance ratio 1:59. In… (More)

- Gabriel Robins, Alex Zelikovsky
- SIAM J. Discrete Math.
- 2005

The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-time heuristic that achieves a best-known approximation ratio of 1 + ln 3 2 ≈ 1.55 for general graphs, and best-known approximation ratios of ≈ 1.28 for quasi-bipartite graphs… (More)

- Jason Cong, Andrew B. Kahng, Gabriel Robins, Majid Sarrafzadeh, Chak-Kuen Wong
- IEEE Trans. on CAD of Integrated Circuits and…
- 1992

We propose a provably good performance-driven global routing algorithm for both cell-based and building-block design. The approach is based on a new bounded-radius minimum routing tree formulation. We first present several heuris-tics with good performance, based on an analog of Prim's minimum spanning tree construction. Next, we give an algorithm which… (More)

- Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCoy, Gabriel Robins
- IEEE Trans. on CAD of Integrated Circuits and…
- 1995

We present critical-sink routing tree (CSRT) constructions which exploit available critical-path information to yield high-performance routing trees. Our CS-Steiner and "global slack removal" algorithms together modify traditional Steiner tree constructions to optimize signal delay at identified critical sinks. We further propose an iterative Elmore routing… (More)

- John Karro, Gabriel Robins
- 1995

Motivated b y improving FPGA performance, we propose a new three-dimensional (3U) FPGA architecture , along with a fabrication methodology. We analyze the expected manufacturing yield, and raise seu-era1 physical-design issues in the new 30 paradigm. Our techniques also have good implications for resource utilization, physical size, and power consumption .

- Christopher S. Helvig, Gabriel Robins, Alex Zelikovsky
- J. Algorithms
- 2003

Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of TSP which we call Moving-Target TSP, where a pursuer must intercept in minimum time a set of targets which move with constant velocities. We propose approximate… (More)

- Andrew B. Kahng, Gabriel Robins
- IEEE Trans. on CAD of Integrated Circuits and…
- 1992

The minimum rectilinear Steiner tree (MRST) problem is very important for such aspects of physical layout as global routing and wiring estimation. Virtually all previous heuristics for computing rectilinear Steiner trees begin with a minimum spanning tree (MST) topology and rearrange edges to induce Steiner points. This paper gives a more direct approach… (More)

- Michael J. Alexander, Gabriel Robins
- 32nd Design Automation Conference
- 1995

Motivated by the goal of increasing the performance of FPGA-based designs, we propose effective Steiner and arborescence FPGA routing algorithms. Our graph-based Steiner tree constructions have provably-good performance bounds and outperform the best known ones in practice, while our arborescence heuristics produce routing solutions with optimal source-sink… (More)

- Christopher S. Helvig, Gabriel Robins, Alex Zelikovsky
- Networks
- 2001

- William R. Pearson, Gabriel Robins, Dallas E. Wrege, Tongtong Zhang
- Discrete Applied Mathematics
- 1996

In this paper we address the problem of primer selection in polymerase chain reaction (PCR) experiments. We prove that the problem of minimizing the number of primers required to amplify a set of DNA sequences is NP-complete. Moreover, we show that it is also intractable to approximate solutions to this problem to within a constant times optimal. On the… (More)