BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
tree (36)
algorithm (24)
problem (20)
rectilinear (17)
approxim (13)

Stem steiner$ (all stems)

63 papers:

SIGMODSIGMOD-2015-ChangLQYZ #algorithm #component
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity (LC, XL, LQ, JXY, WZ), pp. 459–474.
STOCSTOC-2015-Gupta0 #algorithm
Greedy Algorithms for Steiner Forest (AG, AK), pp. 871–878.
STOCSTOC-2015-LackiOPSZ #algorithm #distance #performance #power of
The Power of Dynamic Distance Oracles: Efficient Dynamic Algorithms for the Steiner Tree (JL, JO, MP, PS, AZ), pp. 11–20.
ICALPICALP-v1-2015-FominKLPS #algorithm #polynomial
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (FVF, PK, DL, FP, SS), pp. 494–505.
ICALPICALP-v2-2015-KantorK #problem
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (EK, SK), pp. 675–687.
ICALPICALP-v1-2014-HajiaghayiLP #algorithm #online #problem
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (MH, VL, DP), pp. 576–587.
ICALPICALP-v2-2014-KantorK #problem #symmetry
Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems (EK, SK), pp. 520–531.
STOCSTOC-2013-BabaiW #canonical #design
Quasipolynomial-time canonical form for steiner designs (LB, JW), pp. 261–270.
STOCSTOC-2013-ChenST #design #morphism #multi #testing
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems (XC, XS, SHT), pp. 271–280.
STOCSTOC-2013-GuGK #maintenance #online #power of
The power of deferral: maintaining a constant-competitive steiner tree online (AG, AG, AK), pp. 525–534.
ICALPICALP-v1-2013-BateniHL #algorithm #approximate #problem
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems (MB, MH, VL), pp. 81–92.
DACDAC-2012-LiuCL #algorithm #multi #performance
An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction (CHL, ICC, DTL), pp. 613–622.
STOCSTOC-2012-Chuzhoy #on the
On vertex sparsifiers with Steiner nodes (JC), pp. 673–688.
STOCSTOC-2012-GoemansORZ
Matroids and integrality gaps for hypergraphic steiner tree relaxations (MXG, NO, TR, RZ), pp. 1161–1176.
CIKMCIKM-2012-GubichevN #approximate #graph #performance #scalability
Fast approximation of steiner trees in large graphs (AG, TN), pp. 1497–1501.
DACDAC-2011-HuangY #algorithm
An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles (TH, EFYY), pp. 164–169.
DATEDATE-2011-LuHCT #bound
Steiner tree based rotary clock routing with bounded skew and capacitive load balancing (JL, VH, XC, BT), pp. 455–460.
DATEDATE-2011-YanC #multi
Obstacle-aware multiple-source rectilinear Steiner tree with electromigration and IR-drop avoidance (JTY, ZWC), pp. 449–454.
ICALPICALP-v1-2011-BermanBGRWY #transitive
Steiner Transitive-Closure Spanners of Low-Dimensional Posets (PB, AB, EG, SR, DPW, GY), pp. 760–772.
ICALPICALP-v1-2011-Moldenhauer #algorithm #approximate #graph
Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (CM), pp. 748–759.
CIKMCIKM-2011-BykauMRV #evolution #query #using
Supporting queries spanning across phases of evolving artifacts using Steiner forests (SB, JM, FR, YV), pp. 1649–1658.
STOCSTOC-2010-BateniHM #approximate #bound #graph
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.
STOCSTOC-2010-ByrkaGRS #approximate
An improved LP-based approximation for steiner tree (JB, FG, TR, LS), pp. 583–592.
DACDAC-2009-LiuYKC #algorithm
An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction (CHL, SYY, SYK, YHC), pp. 314–319.
DACDAC-2009-WangCSC #graph #power management #synthesis #using
Low power gated bus synthesis using shortest-path Steiner graph for system-on-chip communications (RW, NCC, BS, CKC), pp. 166–171.
STOCSTOC-2009-GuptaK #approximate #probability
A constant-factor approximation for stochastic Steiner forest (AG, AK), pp. 659–668.
ICALPICALP-v1-2009-DemaineHK09a #graph
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (EDD, MH, PNK), pp. 328–340.
ICALPICALP-v1-2009-Nederlof #algorithm #performance #problem #using
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems (JN), pp. 713–725.
DACDAC-2006-AlpertKSW
Timing-driven Steiner trees are (practically) free (CJA, ABK, CCNS, QW), pp. 389–392.
DACDAC-2006-HuLHL #network
Steiner network construction for timing critical nets (SH, QL, JH, PL), pp. 379–384.
DACDAC-2006-ShiMYH #simulation
Circuit simulation based obstacle-aware Steiner routing (YS, PM, HY, LH), pp. 385–388.
STOCSTOC-2006-FleischerKLS #multi #probability
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (LF, JK, SL, GS), pp. 663–670.
STOCSTOC-2005-JiaLNRS #approximate #set
Universal approximations for TSP, Steiner tree, and set cover (LJ, GL, GN, RR, RS), pp. 386–395.
ICALPICALP-2005-GuptaP #probability
Stochastic Steiner Trees Without a Root (AG, MP), pp. 1051–1063.
ICALPICALP-2005-KonemannLSZ #problem
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem (JK, SL, GS, SHMvZ), pp. 930–942.
SACSAC-2004-JulstromA #algorithm #hybrid #problem
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem (BAJ, AA), pp. 980–984.
ICLPICLP-2004-ErdemW #programming #set #using
Rectilinear Steiner Tree Construction Using Answer Set Programming (EE, MDFW), pp. 386–399.
STOCSTOC-2003-ColeH #algorithm #performance
A fast algorithm for computing steiner edge connectivity (RC, RH), pp. 167–176.
ICALPICALP-2003-ChekuriGN #approximate
Approximating Steiner k-Cuts (CC, SG, JN), pp. 189–199.
SACSAC-2003-HareJ #algorithm #problem #search-based
A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.
DACDAC-2001-BozorgzadehKS #flexibility
Creating and Exploiting Flexibility in Steiner Trees (EB, RK, MS), pp. 195–198.
STOCSTOC-2001-MossR #algorithm #approximate #problem
Approximation algorithms for constrained for constrained node weighted steiner tree problems (AM, YR), pp. 373–382.
SACSAC-2001-Julstrom #encoding
Encoding rectilinear Steiner trees as lists of edges (BAJ), pp. 356–360.
DATEDATE-1998-HelvigRZ #approximate #bound #problem
Improved Approximation Bounds for the Group Steiner Problem (CSH, GR, AZ), pp. 406–413.
STOCSTOC-1998-CharikarCGG #algorithm #approximate
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.
DATEEDTC-1997-LiuS #graph #heuristic #multi #performance #using
Multi-layer chip-level global routing using an efficient graph-based Steiner tree heuristic (LCEL, CS), pp. 311–318.
STOCSTOC-1997-BermanC #algorithm #online #problem
On-Line Algorithms for Steiner Tree Problems (Extended Abstract) (PB, CC), pp. 344–353.
SACSAC-1996-Hartley #problem #satisfiability
Steiner systems and the Boolean satisfiability problem (SJH), pp. 277–281.
SACSAC-1996-Julstom #algorithm #representation #search-based
Representing rectilinear Steiner trees in genetic algorithms (BAJ), pp. 245–250.
DACDAC-1995-HuangKT #bound #on the #problem
On the Bounded-Skew Clock and Steiner Routing Problems (DJHH, ABK, CWAT), pp. 508–513.
STOCSTOC-1995-BorchersD #graph
The k-Steiner ratio in graphs (AB, DZD), pp. 641–649.
STOCSTOC-1995-Pulleyblank #problem
Two Steiner tree packing problems (Extended Abstract) (WRP), pp. 383–387.
SACSAC-1995-ThuenteS #algorithm #hybrid #problem #programming #search-based
Mathematical programming in a hybrid genetic algorithm for Steiner point problems (DJT, PS), pp. 357–363.
DACDAC-1994-BoeseKMR
Rectilinear Steiner Trees with Minimum Elmore Delay (KDB, ABK, BAM, GR), pp. 381–386.
DATEEDAC-1994-EsbensenM #algorithm #graph #problem #search-based
A Genetic Algorithm for the Steiner Problem in a Graph (HE, PM), pp. 402–406.
SACSAC-1994-Julstrom #algorithm #performance #problem #search-based
Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem (BAJ), pp. 222–226.
DACDAC-1993-HongXKCH #algorithm
Performance-Driven Steiner Tree Algorithm for Global Routing (XH, TX, ESK, CKC, JH), pp. 177–181.
DACDAC-1993-LimCW #performance
Performance Oriented Rectilinear Steiner Trees (AL, SWC, CTW), pp. 171–176.
STOCSTOC-1993-WilliamsonGMV #algorithm #approximate #network #problem
A primal-dual approximation algorithm for generalized Steiner network problems (DPW, MXG, MM, VVV), pp. 708–717.
STOCSTOC-1991-AgrawalKR #algorithm #approximate #network #problem
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (AA, PNK, RR), pp. 134–144.
DACDAC-1989-HoVW #approach #problem
A New Approach to the Rectilinear Steiner Tree Problem (JMH, GV, CKW), pp. 161–166.
DACDAC-1986-NgTR
A language for describing rectilinear Steiner tree configurations (APCN, CDT, PR), pp. 659–662.
STOCSTOC-1986-Bern #probability
Two Probabilistic Results on Rectilinear Steiner Trees (MWB), pp. 433–441.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.