The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Steiner tree (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1977-1990 (23) 1991-1992 (15) 1993-1994 (33) 1995-1996 (29) 1997 (19) 1998 (17) 1999 (19) 2000 (26) 2001 (23) 2002 (30) 2003 (40) 2004 (37) 2005 (60) 2006 (74) 2007 (53) 2008 (81) 2009 (50) 2010 (36) 2011 (32) 2012 (4)
Publication types (Num. hits)
article(270) book(1) incollection(4) inproceedings(426)
Venues (Conferences, Journals, ...)
IEEE Trans. on CAD of Integrat...(40) SODA(26) ISAAC(21) Algorithmica(20) STOC(16) ESA(15) ISPD(15) ICALP(14) CoRR(13) DAC(13) ICCAD(12) Inf. Process. Lett.(12) Networks(12) COCOON(11) ASP-DAC(10) ISCAS(10) More (+10 of total 243)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 584 occurrences of 287 keywords

Results
Found 701 publication records. Showing 701 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
4Sun-Yuan Hsieh, Wen-Hao Pi On the Partial-Terminal Steiner Tree Problem. Search on Bibsonomy ISPAN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF The Steiner tree problem, the partial-terminal Steiner tree problem, approximation algorithms, MAX SNP-hardness
4Sun-Yuan Hsieh, Huang-Ming Gao On the partial terminal Steiner tree problem. Search on Bibsonomy The Journal of Supercomputing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF The Steiner tree problem, The partial terminal Steiner tree problem, Approximation algorithms, NP-complete, MAX SNP-hard
3Jan Remy, Angelika Steger Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Computational geometry, Approximation schemes, Steiner tree problem
3Glencora Borradaile, Philip N. Klein, Claire Mathieu An O(n log n) approximation scheme for Steiner tree in planar graphs. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF planar graphs, Steiner tree, approximation scheme
3Yen-Hung Lin, Shu-Hsin Chang, Yih-Lang Li Critical-trunk based obstacle-avoiding rectilinear steiner tree routings for delay and slack optimization. Search on Bibsonomy ISPD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF elmore delay model, obstacle-avoiding rectilinear steiner tree, performance-driven routing, worst negative slack, timing constraint
3Xianyue Li, XiaoHua Xu, Feng Zou, Hongwei Du, Peng-Jun Wan, Yuexuan Wang, Weili Wu A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Node-weighted Steiner tree, minimum weighted connected dominating set, approximation algorithm, polynomial-time approximation scheme
3Jin-Tai Yan Timing-driven octilinear Steiner tree construction based on Steiner-point reassignment and path reconstruction. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF octilinear Steiner tree, Global routing, Elmore delay, Steiner points
3Chien-Chung Shen, Ke Li, Chaiporn Jaikaeo, Vinay Sridhara Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing. Search on Bibsonomy TAAS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Ad hoc networks, multicast, swarm intelligence, constrained Steiner tree
3Jieyi Long, Hai Zhou, Seda Ogrenci Memik An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction. Search on Bibsonomy ISPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF minimum terminal spanning tree, spanning graph, routing, physical design, steiner tree
3Chih-Hung Liu, Yao-Hsin Chou, Shih-Yi Yuan, Sy-Yen Kuo Efficient multilayer routing based on obstacle-avoiding preferred direction steiner tree. Search on Bibsonomy ISPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF routing, spanning tree, physical design, steiner tree
3Markus Prossegger, Abdelhamid Bouchachia Ant colony optimization for Steiner tree problems. Search on Bibsonomy CSTST The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Steiner tree optimization, parallel ant colony optimization, spectral clustering
3Matthias Müller-Hannemann, Siamak Tazari A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Uniform Orientation Metric, Banyan, Planar Graph, Steiner Tree, Spanner, PTAS, Obstacles, Euclidean Metric
3Rashid Bin Muhammad Parallelization of local search for Euclidean Steiner tree problem. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 2006 DBLP  DOI  BibTeX  RDF proximity structure, parallel algorithm, local search, Steiner tree
3Luciano Gualà, Guido Proietti A Truthful (2-2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Approximate Truthful Mechanisms, Algorithmic Mechanism Design, Steiner Tree Problem, Selfish Agents
3Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram Universal approximations for TSP, Steiner tree, and set cover. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF sparse partition, approximation algorithms, TSP, Steiner tree, set cover, universal approximation
3Hongyu Chen, Changge Qiao, Feng Zhou, Chung-Kuan Cheng Refined single trunk tree: a rectilinear steiner tree generator for interconnect prediction. Search on Bibsonomy SLIP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF rectilinear steiner tree algorithm, refined single trunk tree, routing estimation, VLSI CAD
3Martin Thimm On the Approximability of the Steiner Tree Problem. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Minimum Steiner tree, Gadget reduction, Lower bounds, Approximability
3Takumi Okamoto, Jason Cong Buffered Steiner tree construction with wire sizing for interconnect layout optimization. Search on Bibsonomy ICCAD The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Steiner Tree, Buffer Insertion, Interconnect Optimization, Wire Sizing
3Ulrich Fößmeier, Michael Kaufmann, Alexander Zelikovsky Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. Search on Bibsonomy ISAAC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF Algorithms, Approximations, Steiner tree
2Christopher E. Gillies, Nilesh V. Patel, Gautam B. Singh, Serge G. Kruk, Eddie Cheng, George Wilson Minimum Steiner Tree for Automatic SQL Query Generation Applied on a Medical Record Database. Search on Bibsonomy SERVICES The full citation details ... 2011 DBLP  DOI  BibTeX  RDF Electronic Heath Records, Automatic SQL, Databases, Steiner Tree
2Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoß, Laura Sanità An improved LP-based approximation for steiner tree. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximation algorithms, randomized algorithms, network design, linear programming relaxations
2Chih-Hung Liu, Shih-Yi Yuan, Sy-Yen Kuo, Szu-Chi Wang High-performance obstacle-avoiding rectilinear steiner tree construction. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF rectilinear, Routing, Steiner tree, obstacle-avoiding
2Ding-Zhu Du, Bing Lu, Huang Ngo, Panos M. Pardalos Steiner Tree Problems. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF variations of Steiner trees, Approximation algorithms, Combinatorial optimization, Steiner tree, Steiner ratio
2Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. Search on Bibsonomy ICALP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Jesper Nederlof Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. Search on Bibsonomy ICALP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabian M. Suchanek, Gerhard Weikum STAR: Steiner-Tree Approximation in Relationship Graphs. Search on Bibsonomy ICDE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Sang Won Bae, Chunseok Lee, Sunghee Choi On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Chih-Hung Liu, Shih-Yi Yuan, Sy-Yen Kuo, Yao-Hsin Chou An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction. Search on Bibsonomy DAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF routing, spanning tree, physical design, Steiner tree
2Spyros Angelopoulos Online Priority Steiner Tree Problems. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Piotr Berman, Marek Karpinski, Alexander Zelikovsky 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF prize-collecting, stroll, path-TSP, approximation algorithm, traveling salesman problem, Steiner tree
2Sang Won Bae, Sunghee Choi, Chunseok Lee, Shin-ichi Tanigawa Exact Algorithms for the Bottleneck Steiner Tree Problem. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Thomas Erlebach, Ambreen Shahnaz Approximating node-weighted multicast trees in wireless ad-hoc networks. Search on Bibsonomy IWCMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF multicasting, wireless ad-hoc networks, steiner tree
2Tim Roughgarden, Mukund Sundararajan Quantifying inefficiency in cost-sharing mechanisms. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF inefficiency, Mechanism design, Steiner tree, cost sharing, submodular functions
2Jieyi Long, Hai Zhou, Seda Ogrenci Memik EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-Xiang Lee, Yao-Wen Chang Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch Faster Steiner Tree Computation in Polynomial-Space. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Spyros Angelopoulos A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Rashid Bin Muhammad A Parallel Steiner Tree Construction on the Server-Client Model of Computation. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Rashid Bin Muhammad Transmitting Range Assignments Using Steiner Tree in Ad Hoc Wireless Networks. Search on Bibsonomy ITNG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Heiko Hamann, Heinz Wörn Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. Search on Bibsonomy SAB The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Rashid Bin Muhammad Range Assignment Approximation Based on Steiner Tree in Ad Hoc Wireless Networks. Search on Bibsonomy AINA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Shai Gutner Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF prize collecting Steiner tree problem, Approximation algorithms, primal-dual, local ratio
2Iris Hui-Ru Jiang, Shung-Wei Lin, Yen-Ting Yu Unification of obstacle-avoiding rectilinear Steiner tree construction. Search on Bibsonomy SoCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Christian Fobel, Gary Gréwal A parallel Steiner tree heuristic for macro cell routing. Search on Bibsonomy ICCD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Iris Hui-Ru Jiang, Yen-Ting Yu Configurable rectilinear Steiner tree construction for SoC and nano technologies. Search on Bibsonomy ICCD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Rashid Bin Muhammad Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation. Search on Bibsonomy ACIS-ICIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha On the approximability of some network design problems. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation
2Markus Leitner, Günther R. Raidl Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks. Search on Bibsonomy Hybrid Metaheuristics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Redundancy, Network Design, Lagrangian Relaxation, Variable Neighborhood Search, Steiner Tree Problem, Greedy Randomized Adaptive Search Procedure, Survivable Network Design
2Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong Chwa Approximation algorithms for connected facility location problems. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximation algorithms, Integer programming, Steiner tree, LP-rounding, Connected facility location
2Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang Packing trees in communication networks. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Steiner tree packing, Approximation algorithms, Communication networks, Multicast routing, Mathematical programming, Wavelength assignment
2Lap Chi Lau An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*. Search on Bibsonomy Combinatorica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C05, 68R10, 05C70, 68W25, 05C40
2Sergio Consoli, José A. Moreno-Pérez, Ken Darby-Dowman, Nenad Mladenovic Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem. Search on Bibsonomy NICSO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Spyros Angelopoulos Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein A polynomial-time approximation scheme for Steiner tree in planar graphs. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Luc Luyet, Sacha Varone, Nicolas Zufferey An Ant Algorithm for the Steiner Tree Problem in Graphs. Search on Bibsonomy EvoWorkshops The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Sun-Yuan Hsieh, Huang-Ming Gao, Shih-Cheng Yang On the Internal Steiner Tree Problem. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen Chang, Chia-Lin Yang Efficient obstacle-avoiding rectilinear steiner tree construction. Search on Bibsonomy ISPD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF routing, spanning tree, physical design, Steiner tree
2Glencora Borradaile, Philip N. Klein, Claire Mathieu Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar Stochastic Steiner Tree with Non-uniform Inflation. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-Xiang Li, Yao-Wen Chang Efficient multi-layer obstacle-avoiding rectilinear Steiner tree construction. Search on Bibsonomy ICCAD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Srinivas Shakkottai, Xin Liu, R. Srikant The multicast capacity of large multihop wireless networks. Search on Bibsonomy MobiHoc The full citation details ... 2007 DBLP  DOI  BibTeX  RDF asymptotic capacity, multicast flows, ad hoc networks, Steiner tree
2Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto Fourier meets möbius: fast subset convolution. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Möbius transform, Steiner tree, convolution
2Nejla Ghaboosi, Abolfazl Toroghi Haghighat A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem. Search on Bibsonomy ICTAI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Quality of Service, Multicast routing, Path relinking, Constrained Steiner tree
2Bernhard Fuchs, Walter Kern, Xinhui Wang The Number of Tree Stars Is O *(1.357 k ). Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Terminal points, Tree star, Rectilinear Steiner tree
2Nejla Ghaboosi, Abolfazl Toroghi Haghighat Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Search on Bibsonomy Telecommunication Systems The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Intensification, Quality of service, Tabu search, Multicast routing, Diversification, Constrained Steiner tree
2Roberto Cordone, Marco Trubian An exact algorithm for the node weighted Steiner tree problem. Search on Bibsonomy 4OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Prize collecting, Relax-and-cut, Steiner problem
2Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut
2Mohammad Taghi Hajiaghayi, Kamal Jain The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Shampa Chakraverty, Arvind Batra, Aman Rathi Directed Convergence Heuristic: A fast & novel approach to Steiner Tree Construction. Search on Bibsonomy VLSI-SoC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Rashid Bin Muhammad A Parallel Local Search Algorithm for Euclidean Steiner Tree Problem. Search on Bibsonomy SNPD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Daniel Mölle, Stefan Richter, Peter Rossmanith A Faster Algorithm for the Steiner Tree Problem. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Byounghak Yang A Hybrid Evolutionary Algorithm for the Euclidean Steiner Tree Problem Using Local Searches. Search on Bibsonomy KES The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Sun-Yuan Hsieh, Huang-Ming Gao Hardness and Approximation of the Selected-Leaf-Terminal Steiner Tree Problem. Search on Bibsonomy PDCAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Byounghak Yang Hybrid Evolutionary Algorithms for the Rectilinear Steiner Tree Problem Using Fitness Estimation. Search on Bibsonomy ICCSA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF approximation algorithms, stochastic optimization, cost sharing
2Erez Kantor, David Peleg Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
2Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sze, Qinke Wang Timing-driven Steiner trees are (practically) free. Search on Bibsonomy DAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF arborescence, timing-driven, rectilinear Steiner tree
2Jarrod A. Roy, James F. Lu, Igor L. Markov Seeing the forest and the trees: Steiner wirelength optimization in placemen. Search on Bibsonomy ISPD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF routing, placement, physical design, Steiner tree
2Nejla Ghaboosi, Abolfazl Toroghi Haghighat A Tabu Search Based Algorithm for Multicast Routing with QoS Constraints. Search on Bibsonomy ICIT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Quality of Service, Tabu Search, Multicast routing, Constrained Steiner tree
2Nina Skorin-Kapov, Mladen Kos A GRASP heuristic for the delay-constrained multicast routing problem. Search on Bibsonomy Telecommunication Systems The full citation details ... 2006 DBLP  DOI  BibTeX  RDF QoS, Multicast, GRASP, Constrained steiner tree
2Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Yang Spanning graph-based nonrectilinear steiner tree algorithms. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Jingyu Xu, Xianlong Hong, Tong Jing, Yang Yang Obstacle-Avoiding Rectilinear Minimum-Delay Steiner Tree Construction towards IP-Block-Based SOC Design. Search on Bibsonomy ISQED The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Paolo Penna, Carmine Ventre Free-Riders in Steiner Tree Cost-Sharing Games. Search on Bibsonomy SIROCCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price. Search on Bibsonomy CPAIOR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF preflow-push algorithms, networks, Steiner trees, branch-and-cut
2Jin-Tai Yan, Tzu-Ya Wang, Yu-Cheng Lee Timing-driven Steiner tree construction based on feasible assignment of hidden Steiner points. Search on Bibsonomy ISCAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Makoto Fujimoto, Daisuke Takafuji, Toshimasa Watanabe Approximation algorithms for the rectilinear Steiner tree problem with obstacles. Search on Bibsonomy ISCAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Byounghak Yang An Evolution Algorithm for the Rectilinear Steiner Tree Problem. Search on Bibsonomy ICCSA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Jan Remy, Angelika Steger Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
2Gene Eu Jan, Ki-Yin Chang, Su Gao, Ian Parberry A 4-geometry maze router and its application on multiterminal nets. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF ?-geometry, Maze router, cell map, Steiner tree
2Shashi Prabh, Tarek F. Abdelzaher Energy-conserving data cache placement in sensor networks. Search on Bibsonomy TOSN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Energy and bandwidth management, asynchronous multicast, foundations of sensor networks, Steiner tree, data caching
2Marek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Quality of service, Approximation algorithm, Multicast, Interconnection network, Steiner tree
2Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jiang Hu, Stephen T. Quay, Cliff C. N. Sze Porosity-aware buffered Steiner tree construction. Search on Bibsonomy IEEE Trans. on CAD of Integrated Circuits and Systems The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov On the Value of a Random Minimum Weight Steiner Tree. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C80, 68R10, 60C05
2Ian Frommer, Bruce L. Golden, Guruprasad Pundoor Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems. Search on Bibsonomy GECCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. Search on Bibsonomy GECCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Esra Erdem, Martin D. F. Wong Rectilinear Steiner Tree Construction Using Answer Set Programming. Search on Bibsonomy ICLP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
2Qi Zhu, Hai Zhou, Tong Jing, Xianlong Hong, Yang Yang Efficient octilinear Steiner tree construction based on spanning graphs. Search on Bibsonomy ASP-DAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 701 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.