Search results for "rectilinear"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
113	Philippe Delagnes, Dominique Barba	A Markov random field for rectilinear structure extraction in pavement distress image analysis.	ICIP	1995	DBLP DOI BibTeX RDF	crack detection, rectilinear structure extraction, pavement distress image analysis, pavement cracks, rectilinear structure detection, local crack detection, pavement texture, additive correlated noise, line image, regular lattice, straight line segments, Markovian crack model, rectilinear structure shape, rectilinear structure location, observed lattice, image segmentation, image segmentation, feature extraction, edge detection, Markov processes, orientation, image texture, postprocessing, graph structure, Markov random field model, image pixels
86	Xiaoping Tang, Martin D. F. Wong	On handling arbitrary rectilinear shape constraint.	ASP-DAC	2004	DBLP DOI BibTeX RDF
86	Hongjun Zhu, Jianwen Su, Oscar H. Ibarra	Extending Rectangle Join Algorithms for Rectilinear Polygons.	Web-Age Information Management	2000	DBLP DOI BibTeX RDF
85	Joseph L. Ganley, James P. Cohoon	Rectilinear Steiner trees on a checkerboard.	ACM Trans. Design Autom. Electr. Syst.	1996	DBLP DOI BibTeX RDF	full-set decomposition, routing, exact algorithms, rectilinear Steiner tree
85	Joseph L. Ganley, James P. Cohoon	Thumbnail rectilinear Steiner trees.	Great Lakes Symposium on VLSI	1995	DBLP DOI BibTeX RDF	full-set decomposition algorithm, minimum-length set, thumbnail rectilinear Steiner tree problem, VLSI placement algorithms, geometric partitioning, field programmable gate arrays, field-programmable gate arrays, VLSI, dynamic programming, network topology, logic CAD, trees (mathematics), network routing, circuit layout CAD, global routing, line segments
76	Jing Liu 0006, Weicai Zhong, Licheng Jiao, Xue Li 0001	Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning With Arbitrarily Shaped Rectilinear Blocks.	IEEE Trans. Evol. Comput.	2008	DBLP DOI BibTeX RDF
66	Yuchun Ma, Xianlong Hong, Sheqin Dong, Yici Cai, Song Chen 0001, Chung-Kuan Cheng, Jun Gu	Arbitrary convex and concave rectilinear block packing based on corner block list.	ISCAS (5)	2003	DBLP DOI BibTeX RDF
66	W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee	Minimum rectangular partition problem for simple rectilinear polygons.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
65	Bryant A. Julstrom, Athos Antoniades	Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem.	SAC	2004	DBLP DOI BibTeX RDF	Rectilinear Steiner arborescence, perturbation coding, genetic algorithm, permutation coding
61	Zion Cien Shen, Chris C. N. Chu, Ying-Meng Li	Efficient Rectilinear Steiner Tree Construction with Rectilinear Blockages.	ICCD	2005	DBLP DOI BibTeX RDF
60	Jovisa D. Zunic, Paul L. Rosin	Rectilinearity Measurements for Polygons.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	rectilinearity, measurement, Shape, polygons
56	Bryant A. Julstrom, Athos Antoniades	Three Evolutionary Codings of Rectilinear Steiner Arborescences.	GECCO (1)	2004	DBLP DOI BibTeX RDF
56	Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang	Arbitrarily shaped rectilinear module placement using the transitive closure graph representation.	IEEE Trans. Very Large Scale Integr. Syst.	2002	DBLP DOI BibTeX RDF
56	Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang	Arbitrary Convex and Concave Rectilinear Module Packing Using TCG.	DATE	2002	DBLP DOI BibTeX RDF
56	Maggie Zhiwei Kang, Wayne Wei-Ming Dai	Topology constrained rectilinear block packing for layout reuse.	ISPD	1998	DBLP DOI BibTeX RDF
56	Sumanta Guha, Ichiro Suzuki	Proximity Problems and the Voronoi Diagram an a Rectilinear Plane with Rectangular Obstacles.	FSTTCS	1993	DBLP DOI BibTeX RDF
56	Jan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma, Ting-Yi Sung	Algorithms for Rectilinear Optimal Multicast Tree Problem.	ISAAC	1992	DBLP DOI BibTeX RDF
56	Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya	Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time.	SCG	1987	DBLP DOI BibTeX RDF
55	Chih-Hung Liu 0001, 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
55	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
55	Yu Hu 0002, Tong Jing, Zhe Feng 0002, Xianlong Hong, Xiaodong Hu 0001, Guiying Yan	ACO-Steiner: Ant Colony Optimization Based Rectilinear Steiner Minimal Tree Algorithm.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	rectilinear Steiner minimal tree (RSMT), routing, physical design, ant colony optimization (ACO)
55	Chris C. N. Chu, Yiu-Chung Wong	Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design.	ISPD	2005	DBLP DOI BibTeX RDF	rectilinear steiner minimal tree algorithm, wirelength estimation, routing
55	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
55	Ulrich Fößmeier, Michael Kaufmann 0001	On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results.	Algorithmica	2000	DBLP DOI BibTeX RDF	Random instances, Algorithms, Dynamic programming, implementation, Worst-case analysis, Rectilinear Steiner trees
55	Daya Ram Gaur, Toshihide Ibaraki, Ramesh Krishnamurti	Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.	ESA	2000	DBLP DOI BibTeX RDF	Rectangle Stabbing, Rectilinear Partitioning, Approximation Algorithms, Combinatorial Optimization
51	Sven Schuierer	Rectilinear Path Queries in a Simple Rectilinear Polygon.	STACS	1993	DBLP DOI BibTeX RDF
50	Charles C. Chiang, Qing Su, Ching-Shoei Chiang	Wirelength reduction by using diagonal wire.	ACM Great Lakes Symposium on VLSI	2003	DBLP DOI BibTeX RDF	45° routing, diagonal routing, routing, steiner tree
50	Ying-Fung Wu, Peter Widmayer, Martine D. F. Schlag, C. K. Wong	Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles.	IEEE Trans. Computers	1987	DBLP DOI BibTeX RDF	rectilinear metric, Computational geometry, shortest paths, minimum spanning trees, Steiner trees, obstacles
46	Jieyi Long, Hai Zhou 0001, Seda Ogrenci Memik	EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
46	Mark de Berg, Elena Mumford, Bettina Speckmann	Optimal BSPs and rectilinear cartograms.	GIS	2006	DBLP DOI BibTeX RDF	automated cartography, geometric algorithms, indexing structures, binary space partitions, cartograms
46	Mark de Berg, Elena Mumford, Bettina Speckmann	On Rectilinear Duals for Vertex-Weighted Plane Graphs.	GD	2005	DBLP DOI BibTeX RDF
46	Sarnath Ramnath	New approximations for the rectilinear Steiner arborescence problem [VLSI layout].	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
46	Guang-Ming Wu, Yun-Chih Chang, Yao-Wen Chang	Rectilinear block placement using B*-trees.	ACM Trans. Design Autom. Electr. Syst.	2003	DBLP DOI BibTeX RDF	placement, layout, floorplanning, Computer-aided design of VLSI
46	Yingxin Pang, Chung-Kuan Cheng, Koen Lampaert, Weize Xie	Rectilinear block packing using O-tree representation.	ISPD	2001	DBLP DOI BibTeX RDF
46	Hans-Jürgen Bandelt	Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces.	WG	2001	DBLP DOI BibTeX RDF
46	Kunihiro Fujiyoshi, Hiroshi Murata	Arbitrary convex and concave rectilinear block packing usingsequence-pair.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
46	Xiaoyang Mao	Splatting of Non Rectilinear Volumes Through Stochastic Resampling.	IEEE Trans. Vis. Comput. Graph.	1996	DBLP DOI BibTeX RDF
46	Pinaki Mitra, Subhas C. Nandy	Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles.	FSTTCS	1996	DBLP DOI BibTeX RDF
46	Siu-Wing Cheng, Chi-Keung Tang	A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets.	ISAAC	1995	DBLP DOI BibTeX RDF
46	Ting-Hai Chao, Yu-Chin Hsu	Rectilinear Steiner tree construction by local and global refinement.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1994	DBLP DOI BibTeX RDF
46	Kenneth M. McDonald, Joseph G. Peters	Smallest paths in simple rectilinear polygons.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1992	DBLP DOI BibTeX RDF
46	Edmund Ihler	Minimum Rectilinear Steiner Tree for Intervals on two Parallel Lines.	WG	1992	DBLP DOI BibTeX RDF
46	Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong	New algorithms for the rectilinear Steiner tree problem.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
46	Chong-Min Kyung, Josef Widder, Dieter A. Mlynski	Adaptive Cluster Growth (ACG): a new algorithm for circuit packing in rectilinear region.	EURO-DAC	1990	DBLP DOI BibTeX RDF
45	William A. Greene	A tree-based genetic algorithm for building rectilinear Steiner arborescences.	GECCO	2006	DBLP DOI BibTeX RDF	rectilinear Steiner arborescences, tree-based geneticism, tree-structured chromosomes, genetic algorithms
45	Oswin Aichholzer, Hannes Krasser	Abstract order type extension and new results on the rectilinear crossing number.	SCG	2005	DBLP DOI BibTeX RDF	pseudoline arrangement, rectilinear crossing number, complete graph, order type
45	Yuchun Ma, Xianlong Hong, Sheqin Dong, Yici Cai, Chung-Kuan Cheng, Jun Gu	Stairway compaction using corner block list and its applications with rectilinear blocks.	ACM Trans. Design Autom. Electr. Syst.	2004	DBLP DOI BibTeX RDF	corner block list, rectilinear blocks, Floorplanning
45	Dinesh P. Mehta, Naveed A. Sherwani	On the use of flexible, rectilinear blocks to obtain minimum-area floorplans in mixed block and cell designs.	ACM Trans. Design Autom. Electr. Syst.	2000	DBLP DOI BibTeX RDF	mixed block and cell designs, floorplanning, rectilinear polygons
45	Klaus Mueller 0001, Naeem Shareef, Jian Huang, Roger Crawfis	High-Quality Splatting on Rectilinear Grids with Efficient Culling of Occluded Voxels.	IEEE Trans. Vis. Comput. Graph.	1999	DBLP DOI BibTeX RDF	rectilinear grids, visualization, volume rendering, Splatting
45	Teofilo F. Gonzalez, Si-Qing Zheng	Bounds for partitioning rectilinear polygons.	SCG	1985	DBLP DOI BibTeX RDF	approximation algrithms, partition of rectilinear polygons, polynomial time complexity
41	D. T. Lee	Rectilinear Paths among Rectilinear Obstacles.	ISAAC	1992	DBLP DOI BibTeX RDF
40	Piotr Berman, Viswanathan Ramaiyer	Improved Approximations for the Steiner Tree Problem.	SODA	1992	DBLP BibTeX RDF
39	Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood	Improved upper bounds on the crossing number.	SCG	2008	DBLP DOI BibTeX RDF	convex crossing number, rectilinear crossing number, graph drawing, treewidth, crossing number, graph minors, pathwidth, maximum degree
39	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
39	Hüuseyin Kutluca, Tahsin M. Kurç, Cevdet Aykanat	Image-Space Decomposition Algorithms for Sort-First Parallel Volume Rendering of Unstructured Grids.	J. Supercomput.	2000	DBLP DOI BibTeX RDF	sort-first parallelism, image-space decomposition, chains-on-chains partitioning, jagged decomposition, rectilinear decomposition, orthogonal recursive bisection, Hilbert space-filling curve, graph partitioning, unstructured grids, direct volume rendering
36	Chris C. N. Chu, Yiu-Chung Wong	FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
36	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. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
36	Sertac Cinel, Cüneyt F. Bazlamaçci	A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
36	Muhammet Mustafa Ozdal, Martin D. F. Wong, Philip S. Honsinger	Optimal routing algorithms for rectilinear pin clusters in high-density multichip modules.	ACM Trans. Design Autom. Electr. Syst.	2008	DBLP DOI BibTeX RDF	multi-chip modules, network flow, Escape routing
36	Stephane Durocher, Evangelos Kranakis, Danny Krizanc, Lata Narayanan	Balancing Traffic Load Using One-Turn Rectilinear Routing.	TAMC	2008	DBLP DOI BibTeX RDF
36	Jieyi Long, Hai Zhou 0001, 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
36	Liang Li, Evangeline F. Y. Young	Obstacle-avoiding rectilinear Steiner tree construction.	ICCAD	2008	DBLP DOI BibTeX RDF
36	Branislav Micusík, Horst Wildenauer, Jana Kosecka	Detection and matching of rectilinear structures.	CVPR	2008	DBLP DOI BibTeX RDF
36	Iris Hui-Ru Jiang, Yen-Ting Yu	Configurable rectilinear Steiner tree construction for SoC and nano technologies.	ICCD	2008	DBLP DOI BibTeX RDF
36	Iris Hui-Ru Jiang, Shung-Wei Lin, Yen-Ting Yu	Unification of obstacle-avoiding rectilinear Steiner tree construction.	SoCC	2008	DBLP DOI BibTeX RDF
36	Mario Alberto López, Yan Mayster	Weighted Rectilinear Approximation of Points in the Plane.	LATIN	2008	DBLP DOI BibTeX RDF
36	David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang	Compressing rectilinear pictures and minimizing access control lists.	SODA	2007	DBLP BibTeX RDF
36	Jae-Sook Cheong, A. Frank van der Stappen	Computing all form-closure grasps of a rectilinear polyhedron with seven frictionless point fingers.	IROS	2007	DBLP DOI BibTeX RDF
36	Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang	A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction.	ASP-DAC	2007	DBLP DOI BibTeX RDF
36	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
36	Rajasekhar Inkulu, Sanjiv Kapoor	Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures.	FSTTCS	2007	DBLP DOI BibTeX RDF
36	Byounghak Yang	Hybrid Evolutionary Algorithms for the Rectilinear Steiner Tree Problem Using Fitness Estimation.	ICCSA (3)	2006	DBLP DOI BibTeX RDF
36	Matthew J. Katz, Gabriel S. Roisman	On Guarding Rectilinear Domains.	SWAT	2006	DBLP DOI BibTeX RDF
36	Yin Wang, Xianlong Hong, Tong Jing, Yang Yang 0040, Xiaodong Hu 0001, Guiying Yan	The polygonal contraction heuristic for rectilinear Steiner tree construction.	ASP-DAC	2005	DBLP DOI BibTeX RDF
36	Bengt J. Nilsson	Approximate Guarding of Monotone and Rectilinear Polygons.	ICALP	2005	DBLP DOI BibTeX RDF
36	Makoto Fujimoto, Daisuke Takafuji, Toshimasa Watanabe	Approximation algorithms for the rectilinear Steiner tree problem with obstacles.	ISCAS (2)	2005	DBLP DOI BibTeX RDF
36	Byounghak Yang	An Evolution Algorithm for the Rectilinear Steiner Tree Problem.	ICCSA (4)	2005	DBLP DOI BibTeX RDF
36	Matthias Müller-Hannemann, Sven Peyer	Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles.	WADS	2003	DBLP DOI BibTeX RDF
36	Perino M. Dearing, Roy Segars Jr.	An Equivalence Result for Single Facility Planar Location Problems with Rectilinear Distance and Barriers.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF
36	Jie Wu 0001, Dajin Wang	Fault-Tolerant and Deadlock-Free Routing in 2-D Meshes Using Rectilinear-Monotone Polygonal Fault Blocks.	ICPP	2002	DBLP DOI BibTeX RDF	fault tolerance, fault models, virtual channels, Deadlock-free routing, deterministic routing, turn models
36	Sergei Bespamyatnikh, Michael Segal 0001	Fast Maintenance of Rectilinear Centers.	International Conference on Computational Science (1)	2001	DBLP DOI BibTeX RDF
36	Guang-Ming Wu, Yun-Chih Chang, Yao-Wen Chang	Rectilinear Block Placement Using B*-Trees.	ICCD	2000	DBLP DOI BibTeX RDF
36	Xiaotie Deng, Tiko Kameda, Christos H. Papadimitriou	How to Learn an Unknown Environment I: The Rectilinear Case.	J. ACM	1998	DBLP DOI BibTeX RDF	L1 metric, gallery tour, polygon with obstacles, computational geometry, shortest path, on-line algorithms, competitive algorithms
36	Hans-Jürgen Bandelt, Victor Chepoi, Monique Laurent	Embedding into Rectilinear Spaces.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
36	Juan de Vicente, Juan Lanchares, Román Hermida	RSR: A New Rectilinear Steiner Minimum Tree Approximation for FPGA Placement and Global Routing.	EUROMICRO	1998	DBLP DOI BibTeX RDF
36	Chingwei Yeh, Chi-Shong Wang	On the integration of partitioning and global routing for rectilinear placement problems.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
36	Hans-Jürgen Bandelt, Victor Chepoi	Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
36	Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann 0001, Alexander Zelikovsky	Approaching the 5/4-Approximation for Rectilinear Steiner Trees.	ESA	1994	DBLP DOI BibTeX RDF
36	Sven Schuierer	Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel.	SWAT	1994	DBLP DOI BibTeX RDF
36	Martin D. F. Wong, Mohankumar Guruswamy	Channel ordering for VLSI layout with rectilinear modules.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1991	DBLP DOI BibTeX RDF
36	San-Yuan Wu, Sartaj Sahni	Covering rectilinear polygons by rectangles.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
36	D. T. Lee, T. H. Chen, Chung-Do Yang	Shortest Rectilinear Paths among Weighted Obstacles.	SCG	1990	DBLP DOI BibTeX RDF
36	Dana S. Richards, Jeffrey S. Salowe	A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.	SWAT	1990	DBLP DOI BibTeX RDF
36	Ritu Chadha, Donald C. S. Allison	Partitioning rectilinear figures into rectangles.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF
36	Oliver Günther 0001	A Lower Bound and Two Approximate Algorithms for the K-Partitioning of Rectilinear Polygons.	SWAT	1988	DBLP DOI BibTeX RDF
36	R. Shantaram, John Stewart	An algorithm to minimally decompose a rectilinear figure into rectangles (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
35	Bryant A. Julstrom	Encoding rectilinear Steiner trees as lists of edges.	SAC	2001	DBLP DOI BibTeX RDF	Prüfer numbers, evolutionary codings, lists of edges, weighted codings, rectilinear Steiner trees
35	Bryant A. Julstrom	Representing rectilinear Steiner trees in genetic algorithms.	SAC	1996	DBLP DOI BibTeX RDF	genetic encodings, trees, spanning, rectilinear Steiner trees
35	Bryant A. Julstrom	Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem.	SAC	1994	DBLP DOI BibTeX RDF	rectilinear Steiner problem, seeding the population, genetic algorithms, combinatorial optimization
31	Arun Kumar Das 0001, Sandip Das 0001, Anil Maheshwari, Swami Sarvattomananda	Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane.	CALDAM	2023	DBLP DOI BibTeX RDF