Matches in SemOpenAlex for { <https://semopenalex.org/work/W1550372279> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W1550372279 endingPage "542" @default.
- W1550372279 startingPage "533" @default.
- W1550372279 abstract "The classical Steiner Tree Problem requires a shortest tree spanning a given vertex subset within a graph G=(V, E). An important variant is the Steiner tree problem in rectilinear metric. Only recently two algorithms were found which achieve better approximations than the ’traditional’ one with a factor of 3/2. These algorithms with an approximation ratio of 11/8 are quite slow and run in time O(n3) and O(n5/2). A new simple implementation reduces the time to O(n3/2). As our main result we present efficient parameterized algorithms which reach a performance ratio of 11/8+e for any e>0 in time O(n · log2n), and a ratio of 11/8+log log n log n in time O(n · log3n)." @default.
- W1550372279 created "2016-06-24" @default.
- W1550372279 creator A5053940401 @default.
- W1550372279 creator A5056091722 @default.
- W1550372279 creator A5072751459 @default.
- W1550372279 date "1993-01-01" @default.
- W1550372279 modified "2023-10-16" @default.
- W1550372279 title "Faster approximation algorithms for the rectilinear steiner tree problem" @default.
- W1550372279 cites W1975140409 @default.
- W1550372279 cites W1993553699 @default.
- W1550372279 cites W2012130001 @default.
- W1550372279 cites W2020112047 @default.
- W1550372279 cites W2031671531 @default.
- W1550372279 cites W2064086982 @default.
- W1550372279 cites W2069712919 @default.
- W1550372279 cites W2086709935 @default.
- W1550372279 cites W2121473031 @default.
- W1550372279 cites W2401610261 @default.
- W1550372279 cites W4241080567 @default.
- W1550372279 doi "https://doi.org/10.1007/3-540-57568-5_285" @default.
- W1550372279 hasPublicationYear "1993" @default.
- W1550372279 type Work @default.
- W1550372279 sameAs 1550372279 @default.
- W1550372279 citedByCount "5" @default.
- W1550372279 crossrefType "book-chapter" @default.
- W1550372279 hasAuthorship W1550372279A5053940401 @default.
- W1550372279 hasAuthorship W1550372279A5056091722 @default.
- W1550372279 hasAuthorship W1550372279A5072751459 @default.
- W1550372279 hasConcept C113174947 @default.
- W1550372279 hasConcept C11413529 @default.
- W1550372279 hasConcept C114614502 @default.
- W1550372279 hasConcept C126255220 @default.
- W1550372279 hasConcept C148764684 @default.
- W1550372279 hasConcept C33923547 @default.
- W1550372279 hasConcept C41008148 @default.
- W1550372279 hasConcept C76220878 @default.
- W1550372279 hasConceptScore W1550372279C113174947 @default.
- W1550372279 hasConceptScore W1550372279C11413529 @default.
- W1550372279 hasConceptScore W1550372279C114614502 @default.
- W1550372279 hasConceptScore W1550372279C126255220 @default.
- W1550372279 hasConceptScore W1550372279C148764684 @default.
- W1550372279 hasConceptScore W1550372279C33923547 @default.
- W1550372279 hasConceptScore W1550372279C41008148 @default.
- W1550372279 hasConceptScore W1550372279C76220878 @default.
- W1550372279 hasLocation W15503722791 @default.
- W1550372279 hasOpenAccess W1550372279 @default.
- W1550372279 hasPrimaryLocation W15503722791 @default.
- W1550372279 hasRelatedWork W1992362850 @default.
- W1550372279 hasRelatedWork W2181735406 @default.
- W1550372279 hasRelatedWork W2795459024 @default.
- W1550372279 hasRelatedWork W2798395708 @default.
- W1550372279 hasRelatedWork W2953071209 @default.
- W1550372279 hasRelatedWork W2956215892 @default.
- W1550372279 hasRelatedWork W2963193695 @default.
- W1550372279 hasRelatedWork W2963258629 @default.
- W1550372279 hasRelatedWork W4293583696 @default.
- W1550372279 hasRelatedWork W4297749916 @default.
- W1550372279 isParatext "false" @default.
- W1550372279 isRetracted "false" @default.
- W1550372279 magId "1550372279" @default.
- W1550372279 workType "book-chapter" @default.