Matches in SemOpenAlex for { <https://semopenalex.org/work/W3017016309> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W3017016309 endingPage "106096" @default.
- W3017016309 startingPage "106096" @default.
- W3017016309 abstract "We study the problem of exploring all vertices of an undirected weighted graph that is initially unknown to the searcher. An edge of the graph is only revealed when the searcher visits one of its endpoints. Beginning at some start node, the searcher's goal is to visit every vertex of the graph before returning to the start node on a tour as short as possible. We prove that the Nearest Neighbor algorithm's competitive ratio on trees with n vertices is Θ(logn), i.e. no better than on general graphs. Furthermore, we examine the algorithm Blocking for a range of parameters not considered previously and prove it is 3-competitive on unicyclic graphs as well as 5/2+2≈3.91-competitive on cactus graphs. The best known lower bound for these two graph classes is 2." @default.
- W3017016309 created "2020-04-24" @default.
- W3017016309 creator A5040972680 @default.
- W3017016309 date "2021-06-01" @default.
- W3017016309 modified "2023-09-23" @default.
- W3017016309 title "Online graph exploration on trees, unicyclic graphs and cactus graphs" @default.
- W3017016309 cites W105334049 @default.
- W3017016309 cites W1992876208 @default.
- W3017016309 cites W2008110774 @default.
- W3017016309 cites W2011318188 @default.
- W3017016309 cites W2065818036 @default.
- W3017016309 cites W2101753085 @default.
- W3017016309 cites W2956015669 @default.
- W3017016309 cites W3036524578 @default.
- W3017016309 doi "https://doi.org/10.1016/j.ipl.2021.106096" @default.
- W3017016309 hasPublicationYear "2021" @default.
- W3017016309 type Work @default.
- W3017016309 sameAs 3017016309 @default.
- W3017016309 citedByCount "1" @default.
- W3017016309 countsByYear W30170163092019 @default.
- W3017016309 crossrefType "journal-article" @default.
- W3017016309 hasAuthorship W3017016309A5040972680 @default.
- W3017016309 hasBestOaLocation W30170163092 @default.
- W3017016309 hasConcept C114614502 @default.
- W3017016309 hasConcept C118615104 @default.
- W3017016309 hasConcept C132525143 @default.
- W3017016309 hasConcept C203776342 @default.
- W3017016309 hasConcept C33923547 @default.
- W3017016309 hasConcept C41008148 @default.
- W3017016309 hasConcept C43413943 @default.
- W3017016309 hasConcept C43517604 @default.
- W3017016309 hasConcept C80899671 @default.
- W3017016309 hasConceptScore W3017016309C114614502 @default.
- W3017016309 hasConceptScore W3017016309C118615104 @default.
- W3017016309 hasConceptScore W3017016309C132525143 @default.
- W3017016309 hasConceptScore W3017016309C203776342 @default.
- W3017016309 hasConceptScore W3017016309C33923547 @default.
- W3017016309 hasConceptScore W3017016309C41008148 @default.
- W3017016309 hasConceptScore W3017016309C43413943 @default.
- W3017016309 hasConceptScore W3017016309C43517604 @default.
- W3017016309 hasConceptScore W3017016309C80899671 @default.
- W3017016309 hasLocation W30170163091 @default.
- W3017016309 hasLocation W30170163092 @default.
- W3017016309 hasOpenAccess W3017016309 @default.
- W3017016309 hasPrimaryLocation W30170163091 @default.
- W3017016309 hasRelatedWork W1966443870 @default.
- W3017016309 hasRelatedWork W2008957319 @default.
- W3017016309 hasRelatedWork W2044762907 @default.
- W3017016309 hasRelatedWork W2051302547 @default.
- W3017016309 hasRelatedWork W2059195705 @default.
- W3017016309 hasRelatedWork W2171130131 @default.
- W3017016309 hasRelatedWork W2374778222 @default.
- W3017016309 hasRelatedWork W2910018628 @default.
- W3017016309 hasRelatedWork W2951566485 @default.
- W3017016309 hasRelatedWork W3182166453 @default.
- W3017016309 hasVolume "168" @default.
- W3017016309 isParatext "false" @default.
- W3017016309 isRetracted "false" @default.
- W3017016309 magId "3017016309" @default.
- W3017016309 workType "article" @default.