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