Sciweavers

1671 search results - page 10 / 335
» On the Covering Steiner Problem
Sort
View
VLSID
2002
IEEE
109views VLSI» more  VLSID 2002»
14 years 10 months ago
Probabilistic Analysis of Rectilinear Steiner Trees
Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design. We present a probabilistic analysis method for constructing rectilinear Steiner t...
Chunhong Chen
IPCO
2010
148views Optimization» more  IPCO 2010»
13 years 11 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
13 years 11 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 11 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
SODA
2008
ACM
73views Algorithms» more  SODA 2008»
13 years 11 months ago
Set connectivity problems in undirected graphs and the directed Steiner network problem
Chandra Chekuri, Guy Even, Anupam Gupta, Danny Seg...