FRINK Linked Data Fragments server

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

• W2007918688 endingPage "6896" @default.
• W2007918688 startingPage "6879" @default.
• W2007918688 abstract "We study the problem of minimizing the weighted average number of queries to identify an initially unknown object in a poset. We show that for general posets, there cannot be any o ( log n ) -approximation algorithm unless NP ⊆ TIME ( n O ( log log n ) ) . When the Hasse diagram of the partially ordered set has the structure of a tree, the problem is equivalent to the following tree search problem : in a given rooted tree T = ( V , E ) a node has been marked and we want to identify it. In order to locate the marked node, we can perform node queries. A node query u asks whether the marked node lies in the subtree rooted at u . A function w : V → Z + is given which defines the likelihood for a node to be the one marked, and we want the strategy that minimizes the expected number of queries. Prior to this paper the complexity of this problem had remained open. We prove that the above tree search problem is NP -complete even for the class of trees with diameter at most 4. This results in a complete characterization of the complexity of the problem with respect to the diameter size. In fact, for diameter not larger than 3 we show that the problem is polynomially solvable using a dynamic programming approach. In addition we prove that the problem is NP -complete even for the class of trees of maximum degree at most 16. To the best of our knowledge, the only known result in this direction is that the tree search problem is solvable in O ( | V | log | V | ) time for trees with degree at most 2 (paths). Our results sharply contrast with those for the variant of the problem where one is interested in minimizing the maximum number of queries. In fact, for the worst case scenario, linear time algorithms are known for finding an optimal search strategy [K. Onak, P. Parys, Generalization of binary search: searching in trees and forest-like partial orders, in: FOCS’06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, USA, 2006, pp. 379–388; S. Mozes, K. Onak, O. Weimann, Finding an optimal tree searching strategy in linear time, in: SODA’08: Proceedings of the Nineteenth Annual ACM–SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2008, pp. 1096–1105]." @default.
• W2007918688 created "2016-06-24" @default.
• W2007918688 creator A5037548562 @default.
• W2007918688 creator A5073527139 @default.
• W2007918688 creator A5084704118 @default.
• W2007918688 creator A5091196390 @default.
• W2007918688 date "2011-11-01" @default.
• W2007918688 modified "2023-10-16" @default.
• W2007918688 title "On the complexity of searching in trees and partially ordered structures" @default.
• W2007918688 cites W1522510201 @default.
• W2007918688 cites W1966723613 @default.
• W2007918688 cites W1970074386 @default.
• W2007918688 cites W1975968324 @default.
• W2007918688 cites W1996384709 @default.
• W2007918688 cites W2008789644 @default.
• W2007918688 cites W2025583426 @default.
• W2007918688 cites W2049821958 @default.
• W2007918688 cites W2064883689 @default.
• W2007918688 cites W2065954102 @default.
• W2007918688 cites W2066209652 @default.
• W2007918688 cites W2070004158 @default.
• W2007918688 cites W2079306236 @default.
• W2007918688 cites W2143996311 @default.
• W2007918688 cites W2154838933 @default.
• W2007918688 cites W2157642372 @default.
• W2007918688 cites W2329924640 @default.
• W2007918688 cites W2697349394 @default.
• W2007918688 cites W4256130480 @default.
• W2007918688 doi "https://doi.org/10.1016/j.tcs.2011.08.042" @default.
• W2007918688 hasPublicationYear "2011" @default.
• W2007918688 type Work @default.
• W2007918688 sameAs 2007918688 @default.
• W2007918688 citedByCount "27" @default.
• W2007918688 countsByYear W20079186882012 @default.
• W2007918688 countsByYear W20079186882013 @default.
• W2007918688 countsByYear W20079186882015 @default.
• W2007918688 countsByYear W20079186882016 @default.
• W2007918688 countsByYear W20079186882017 @default.
• W2007918688 countsByYear W20079186882018 @default.
• W2007918688 countsByYear W20079186882020 @default.
• W2007918688 countsByYear W20079186882021 @default.
• W2007918688 countsByYear W20079186882022 @default.
• W2007918688 countsByYear W20079186882023 @default.
• W2007918688 crossrefType "journal-article" @default.
• W2007918688 hasAuthorship W2007918688A5037548562 @default.
• W2007918688 hasAuthorship W2007918688A5073527139 @default.
• W2007918688 hasAuthorship W2007918688A5084704118 @default.
• W2007918688 hasAuthorship W2007918688A5091196390 @default.
• W2007918688 hasBestOaLocation W20079186881 @default.
• W2007918688 hasConcept C114614502 @default.
• W2007918688 hasConcept C33923547 @default.
• W2007918688 hasConcept C41008148 @default.
• W2007918688 hasConcept C80444323 @default.
• W2007918688 hasConceptScore W2007918688C114614502 @default.
• W2007918688 hasConceptScore W2007918688C33923547 @default.
• W2007918688 hasConceptScore W2007918688C41008148 @default.
• W2007918688 hasConceptScore W2007918688C80444323 @default.
• W2007918688 hasIssue "50" @default.
• W2007918688 hasLocation W20079186881 @default.
• W2007918688 hasOpenAccess W2007918688 @default.
• W2007918688 hasPrimaryLocation W20079186881 @default.
• W2007918688 hasRelatedWork W1974891317 @default.
• W2007918688 hasRelatedWork W1978042415 @default.
• W2007918688 hasRelatedWork W2017331178 @default.
• W2007918688 hasRelatedWork W2044189972 @default.
• W2007918688 hasRelatedWork W2313400459 @default.
• W2007918688 hasRelatedWork W2392953011 @default.
• W2007918688 hasRelatedWork W2748952813 @default.
• W2007918688 hasRelatedWork W2899084033 @default.
• W2007918688 hasRelatedWork W2976797620 @default.
• W2007918688 hasRelatedWork W3086542228 @default.
• W2007918688 hasVolume "412" @default.
• W2007918688 isParatext "false" @default.
• W2007918688 isRetracted "false" @default.
• W2007918688 magId "2007918688" @default.
• W2007918688 workType "article" @default.