FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2243550444> ?p ?o ?g. }

• W2243550444 abstract "We consider different variants of network design problems. Given a set of points in the plane we search for a shortest interconnection of them. In this general formulation the problem is known as Steiner tree problem. We consider the special case of octilinear Steiner trees in the presence of hard and soft obstacles. In an octilinear Steiner tree the line segments connecting the points are allowed to run either in horizontal, vertical or diagonal direction. An obstacle is a connected region in the plane bounded by a simple polygon. No line segment of an octilinear Steiner tree is allowed to lie in the interior of a hard obstacle. If we intersect a Steiner tree with the interior of a soft obstacle, no connected component of the induced subtree is allowed to be longer than a given fixed length. We provide polynomial time approximation schemes for the octilinear Steiner tree problem in the presence of hard and soft obstacles. These were the first presented approximation schemes introduced for the problems. Additionally, we introduce a (2+epsilon)-approximation algorithm for soft obstacles. We then turn to Euclidean group Steiner trees. Instead of a set of fixed points we get for each point a set of potential locations (combined into groups) and we need to pick only one location of each group. The groups we consider lie inside disjoint regions fulfilling a special property so-called alpha-fatness. Roughly speaking, the term alpha-fat specifies the shape of the region in comparison to a disk. We give the first approximation algorithm for this problem and achieve an approximation ratio of (1+epsilon)(9.093alpha +1). Last, we consider Manhattan networks. They are allowed to contain edges only in horizontal and vertical direction. In contrast to Steiner trees they contain a shortest path between each pair of points. We introduce insights into the structure of Manhattan networks, particularly in the context of so-called staircases. We give three new approximation algorithms for the Manhattan network problem, the first with approximation ratio 3 and two algorithms with ratio 2. To this end we introduce two algorithms for the Manhattan network problem of staircases. The first algorithm solves the problem to optimality the second yields a 2-approximation. Variants of both algorithms are already known in the literature. Since we use a slightly different definition of staircases and we need special properties of them, we adopt the algorithms to our situation. The 2-approximation algorithms achieve the best known approximation ratio of an algorithm for the Manhattan network problem known so far. Last we give an idea how we could possibly find an algorithm with better approximation ratio." @default.
• W2243550444 created "2016-06-24" @default.
• W2243550444 creator A5040108937 @default.
• W2243550444 date "2008-01-01" @default.
• W2243550444 modified "2023-09-27" @default.
• W2243550444 title "Approximation Algorithms for Network Design Problems" @default.
• W2243550444 hasPublicationYear "2008" @default.
• W2243550444 type Work @default.
• W2243550444 sameAs 2243550444 @default.
• W2243550444 citedByCount "0" @default.
• W2243550444 crossrefType "dissertation" @default.
• W2243550444 hasAuthorship W2243550444A5040108937 @default.
• W2243550444 hasConcept C113174947 @default.
• W2243550444 hasConcept C11413529 @default.
• W2243550444 hasConcept C114614502 @default.
• W2243550444 hasConcept C118615104 @default.
• W2243550444 hasConcept C126042441 @default.
• W2243550444 hasConcept C134306372 @default.
• W2243550444 hasConcept C148764684 @default.
• W2243550444 hasConcept C167204820 @default.
• W2243550444 hasConcept C182124507 @default.
• W2243550444 hasConcept C190694206 @default.
• W2243550444 hasConcept C193435613 @default.
• W2243550444 hasConcept C198352243 @default.
• W2243550444 hasConcept C2524010 @default.
• W2243550444 hasConcept C33923547 @default.
• W2243550444 hasConcept C34388435 @default.
• W2243550444 hasConcept C41008148 @default.
• W2243550444 hasConcept C45340560 @default.
• W2243550444 hasConcept C76155785 @default.
• W2243550444 hasConcept C76220878 @default.
• W2243550444 hasConceptScore W2243550444C113174947 @default.
• W2243550444 hasConceptScore W2243550444C11413529 @default.
• W2243550444 hasConceptScore W2243550444C114614502 @default.
• W2243550444 hasConceptScore W2243550444C118615104 @default.
• W2243550444 hasConceptScore W2243550444C126042441 @default.
• W2243550444 hasConceptScore W2243550444C134306372 @default.
• W2243550444 hasConceptScore W2243550444C148764684 @default.
• W2243550444 hasConceptScore W2243550444C167204820 @default.
• W2243550444 hasConceptScore W2243550444C182124507 @default.
• W2243550444 hasConceptScore W2243550444C190694206 @default.
• W2243550444 hasConceptScore W2243550444C193435613 @default.
• W2243550444 hasConceptScore W2243550444C198352243 @default.
• W2243550444 hasConceptScore W2243550444C2524010 @default.
• W2243550444 hasConceptScore W2243550444C33923547 @default.
• W2243550444 hasConceptScore W2243550444C34388435 @default.
• W2243550444 hasConceptScore W2243550444C41008148 @default.
• W2243550444 hasConceptScore W2243550444C45340560 @default.
• W2243550444 hasConceptScore W2243550444C76155785 @default.
• W2243550444 hasConceptScore W2243550444C76220878 @default.
• W2243550444 hasLocation W22435504441 @default.
• W2243550444 hasOpenAccess W2243550444 @default.
• W2243550444 hasPrimaryLocation W22435504441 @default.
• W2243550444 hasRelatedWork W1515344112 @default.
• W2243550444 hasRelatedWork W1803392673 @default.
• W2243550444 hasRelatedWork W192134417 @default.
• W2243550444 hasRelatedWork W1999686335 @default.
• W2243550444 hasRelatedWork W2017060216 @default.
• W2243550444 hasRelatedWork W2047629658 @default.
• W2243550444 hasRelatedWork W2049234398 @default.
• W2243550444 hasRelatedWork W2110605075 @default.
• W2243550444 hasRelatedWork W2127728226 @default.
• W2243550444 hasRelatedWork W2289848075 @default.
• W2243550444 hasRelatedWork W2404994809 @default.
• W2243550444 hasRelatedWork W2409680466 @default.
• W2243550444 hasRelatedWork W2493762868 @default.
• W2243550444 hasRelatedWork W2584822530 @default.
• W2243550444 hasRelatedWork W2900103971 @default.
• W2243550444 hasRelatedWork W2913235017 @default.
• W2243550444 hasRelatedWork W2955375576 @default.
• W2243550444 hasRelatedWork W3109337285 @default.
• W2243550444 hasRelatedWork W3166185060 @default.
• W2243550444 hasRelatedWork W2085143999 @default.
• W2243550444 isParatext "false" @default.
• W2243550444 isRetracted "false" @default.
• W2243550444 magId "2243550444" @default.
• W2243550444 workType "dissertation" @default.