The solution of the Mgebralc path problem, for instance with the algorithm by Floyd and WarshM1, is part of the classical repertoire on Mgorithms. This solution presupposes that path costs are computed in a dosed semiring or a similar algebraic structure. The associativity and distributivity laws in such algebraic structures exclude many possible path costs. In the seventies, several authors have developed algebraic methods in order to overcome such restrictions.Recently, applications have created the need for handling such unstructured path costs. Motiwted by such applications, we investigate the efficiency of algorithms solving path problems with unstructured costs. The resulting procedure allows for developing efficient algorithms for solving the algebraic path problem with respect to a wide variety of cost measures, including finding shortest paths with discounting, and counting paths or computing the expected length of paths with desired properties. I n t r o d u c t i o nThe algebraic path problem is defined as follows. We are given a directed graph G = ( { 1 , . . . , n}, E) with an edge labeling A : E --~ R into a set R. Edge values can be composed with a binary operation Q, in order to yield costs of paths of edges. ~(;) = ("'(~(v0,,,)O~(v,,v2))OX(,~,v3))-")e~(,k-l,vk)The operation (~ has a neutral element (~ 0 = 0. The operation ® has a neutral element 1 which is also the cost of the empty patl~LS Po,i from each vertex i, 1 < i < n, to itself. We call C = (R, ~, ®, 0,1) an algebraic cost structure. There are basically two approaches to solving algebraic path problems in the literature. The first approach--pursued by several authors in different application areas, see e.g. [5, 6, 9, 10, 13, 15, 16, 19J--requires the algebraic cost structure C = (R, (D, ®, 0,1) to fulfill the following additional requirements.A I : Q is associative.A 2 : 0 is absorptive over (D, Le., for all r E R, we have r ® 0 = 0 Q r = 0.
Due to the application of fast device technologies and the increasing complexity of printed{ circuit boards, electromagnetic phenomena, e.g., re ections and crosstalk, gain more and more importance and may even disturb the function of a circuit. In the future, it will be indispensable to consider phenomena of electromagnetic compatibility (EMC) already during layout synthesis. In this paper, robust methods are presented that make it possible for the rst time to incorporate complex EMC{constraints and cost criteria into printed{circuit board routing. This includes both, concepts for the development and speci cation of EMC{design models and robust and e cient algorithms for EMC{driven routing which can handle these models.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.