A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
The two disjoint path problem and wire routing design
[chapter]
1981
Lecture Notes in Computer Science
Preserved Fulltext
An application of the two disjoint path algorithm to the automatic wire routing is also discussed. 1. ...
A new polynomial time algorithm is presented for finding two vertex-disjoint paths between two specified pairs of vertices on an undirected graph. ...
G is a graph with two disjoint paths P(Sl,t2) and Q(s2,t I) specified. ...
doi:10.1007/3-540-10704-5_18
fatcat:fw433is2rrgrvbh5kkmglfwase
A Length Matching Routing Algorithm for Set-Pair Routing Problem
2015
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In the routing design of interposer and etc., the combination of a pin pair to be connected by wire is often flexible, and the reductions of the total wire length and the length difference are pursued ...
Even though the total wire length can be minimized by finding a minimum cost maximum flow in set pair routing problems, the length difference is often large, and the reduction of it is not easy. ...
Acknowledgments The authors would like to thank Mr. Yusaku Yamamoto for his collaborative research with the authors when he was at Osaka University and Tokyo Institute of Technology. ...
doi:10.1587/transfun.e98.a.2565
fatcat:3adtivcatnacdkjzyphkaasy4e
Optimal Placement for River Routing
1983
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We would like to thank Howie Shrobe of the MIT Artificial Intelligence Laboratory for posting the plots of the data paths from the Scheme8l chip which inspired our interest in this placement problem and ...
We would also like to thank Alan Baratz and Ron Rivest from the MIT Laboratory for Computer Science for numerous helpful discussions, and Shlomit Pinter also from the Laboratory for Computer Science for ...
We must now show that the locus of points for a wire is a path, that the paths are disjoint, and that they never leave the channel. ...
doi:10.1137/0212029
fatcat:po3tsorhsnddreosxsdetpvseq
On the escape routing of differential pairs
2010
2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study the differential pair escape routing problem and propose two algorithms. ...
As an important step in PCB design, the escape routing problem has been extensively studied in literature. However, few studies have been done on the escape routing of differential pairs. ...
This essentially becomes a general routing problem: find disjoint paths connecting pairs of pins in a grid and minimize the total length of the paths. ...
doi:10.1109/iccad.2010.5654214
dblp:conf/iccad/YanWMW10
fatcat:ogph7jonebbr3haal645jndyfa
CAFE Router: A Fast Connectivity Aware Multiple Nets Routing Algorithm for Routing Grid with Obstacles
2010
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the routing design of PCB, the controllability of wire length is often focused on since it enables us to control the routing delay. ...
CAFE router extends the route of each net from a terminal to the other terminal greedily so that the wire length of the net approaches its target wire length. ...
Acknowledgements The authors would like to thank Toshiyuki Shibuya of Fujitsu Laboratories of America, Inc. for his helpful suggestions. ...
doi:10.1587/transfun.e93.a.2380
fatcat:axneqozbgjdtbmro4rthadjgie
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
1995
Proceedings - Design Automation Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. ...
By applying one algorithm first and then switching to the other when the first one approaches its decaying stage, the undesired effect can be significantly reduced and thus better results are produced. ...
Therefore, this routing architecture is disjoint, since when all S box switches are closed, then all wire segments are partitioned into D>1 disjoint connected wire sets, called domains , and a given domain ...
doi:10.1109/dac.1995.250011
fatcat:d3jczdqy4nc67nr4iufobztimi
Orthogonal greedy coupling
1995
Proceedings of the 32nd ACM/IEEE conference on Design automation conference - DAC '95
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. ...
By applying one algorithm first and then switching to the other when the first one approaches its decaying stage, the undesired effect can be significantly reduced and thus better results are produced. ...
Therefore, this routing architecture is disjoint, since when all S box switches are closed, then all wire segments are partitioned into D>1 disjoint connected wire sets, called domains , and a given domain ...
doi:10.1145/217474.217591
dblp:conf/dac/WuM95
fatcat:qdqfz5hmnnay7j4r6uep3w647i
Providing protection in multi-hop wireless networks
2013
2013 Proceedings IEEE INFOCOM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Typically, protection in wired networks is provided through the provisioning of backup paths. ...
More importantly, we show that providing protection in a wireless network uses as much as 72% less protection resources as compared to similar protection schemes designed for wired networks, and that in ...
We solve the shortest disjoint pair of paths problem by solving the following optimization problem: find a flow of minimum cost to route two units from s to d in a graph with unit capacity and unit cost ...
doi:10.1109/infcom.2013.6566881
dblp:conf/infocom/KupermanM13a
fatcat:wl6op5e3bza4hg44f4pjkquo2i
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
2007
Ad hoc networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
The objective is to maximize the network capacity, i.e. maximize the number of messages routed successfully by the network without any knowledge of future disjoint path connection request arrivals and ...
Specifically, in this paper we first present two centralized on-line algorithms for the problem. ...
Xiaoxing Guo for implementing the proposed algorithms and evaluating their performance against the ones of existing algorithms. Also, we would like to thank the anonymous ...
doi:10.1016/j.adhoc.2005.11.004
fatcat:svcvxisngre3hhb4foyw5w2osa
Transistor-level layout of high-density regular circuits
2009
Proceedings of the 2009 international symposium on Physical design - ISPD '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
compete for wire segments and viasSAT solverEvoked when problem is sufficiently reduced by greedy routing Introduction
Modern IC technology experiences
manufacturing difficulties
Regular Fabric ...
The number of disconnected components of a net K-greedy: The greedy algorithm stops when all nets consist of at most K disjoint sub-nets 1-greedy: The greedy algorithm attempts to complete the routing ...
doi:10.1145/1514932.1514954
dblp:conf/ispd/LinMM09
fatcat:ovfyb6hbpbejrklf4iehncdx5i
Application of Wireless Network Control to Course-Keeping for Ships
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
From the aspect of communication, the design is based on the concurrent and disjoint multipath routing ZigBee network, which can ensure the effective application of the control algorithm. ...
To solve the problems of redundant wired networks in ships, the paper designs a wireless network as a redundant network for a ship's control system. ...
ACKNOWLEDGMENT The authors would like to thank all the anonymous reviewers for their valuable comments and suggestions for improving the quality of this paper. ...
doi:10.1109/access.2020.2973464
fatcat:kbcp6ql6vbat7it3b647cznkvi
An efficient placement and routing technique for fault-tolerant distributed embedded computing
2009
ACM Transactions on Embedded Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Then, we study two problems of placement and routing in the sensor networks such that the fault tolerance is maximized while the power consumption is minimized. ...
We develop efficient integer linear programming (ILP) formulations to address these problems and perform both placement and routing, simultaneously. ...
≤ i ≤ M 1 ≤ j ≤ N (28)
Placement Traditional placement and routing problems in VLSI CAD are considered as two separate problems. ...
doi:10.1145/1550987.1550991
fatcat:zoomfh52unfitkhkz2yxszmoky
Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
2007
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We aim at routing all nets in a cubic grid (above the original grid holding the terminals) in a vertex-disjoint way. ...
The vertices of the grid are called terminals and pairwise disjoint sets of terminals are called nets. ...
Acknowledgements Research is partially supported by the Center for Applied Mathematics and Computational Physics and by the Hungarian National Science Fund (Grant nos. OTKA 37547, 42559 and 44733). ...
doi:10.1016/j.dam.2006.05.010
fatcat:4pertwxkzvhv5np3rd6pzwcwke
Protecting Multicast Sessions in Wireless Mesh Networks
2006
Local Computer Networks (LCN), Proceedings of the IEEE Conference on
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Utilizing the wireless broadcast advantage, a resilient forwarding mesh effectively establishes two node disjoint paths for each sourcedestination pair. ...
The issue of protecting multicast sessions in wireless mesh networks is a new problem to the best of our knowledge. ...
Acknowledgments This project is supported by Australian Research Council (ARC) Discovery Grant DP0664791 and UNSW Goldstar Award. ...
doi:10.1109/lcn.2006.322141
dblp:conf/lcn/ZhaoCGJ06
fatcat:6iixenaszfdhtmbndfefca5p5u
Joint power control and maximally disjoint routing for reliable data delivery in multihop CDMA wireless ad hoc networks
2006
IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, joint power control and maximally disjoint routing is proposed for multihop CDMA wireless ad hoc networks. ...
A framework of power control with QoS constraints in CDMA wireless ad hoc networks is introduced and the feasibility condition of the power control problem is identified. ...
However, because there are major differences on how to use the obtained disjoint paths to send data between our approach and that in [18] , the routing designs are completely different. ...
doi:10.1109/wcnc.2006.1683481
dblp:conf/wcnc/QianSVLG06
fatcat:2inob7wpl5ailbrmajt4t37z44
« Previous
Showing results 1 — 15 out of 6,109 results