Matches in SemOpenAlex for { <https://semopenalex.org/work/W1973984239> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W1973984239 endingPage "572" @default.
- W1973984239 startingPage "565" @default.
- W1973984239 abstract "Abstract In this paper we formulate the mini-max spanning forest problem for undirected graphs as a generalization of the minimum spanning tree problem. We prove that the former problem is NP -hard. Then we develop a heuristic algorithm to solve this problem approximately, and give an upper bound for relative errors. Through a series of numerical tests, we examine the performance of the developed algorithm." @default.
- W1973984239 created "2016-06-24" @default.
- W1973984239 creator A5000863924 @default.
- W1973984239 creator A5049356164 @default.
- W1973984239 creator A5066082409 @default.
- W1973984239 date "1996-06-01" @default.
- W1973984239 modified "2023-09-26" @default.
- W1973984239 title "A heuristic algorithm for the mini-max spanning forest problem" @default.
- W1973984239 cites W2017927472 @default.
- W1973984239 cites W2087216833 @default.
- W1973984239 doi "https://doi.org/10.1016/0377-2217(94)00335-1" @default.
- W1973984239 hasPublicationYear "1996" @default.
- W1973984239 type Work @default.
- W1973984239 sameAs 1973984239 @default.
- W1973984239 citedByCount "22" @default.
- W1973984239 countsByYear W19739842392013 @default.
- W1973984239 countsByYear W19739842392014 @default.
- W1973984239 countsByYear W19739842392015 @default.
- W1973984239 countsByYear W19739842392017 @default.
- W1973984239 countsByYear W19739842392019 @default.
- W1973984239 countsByYear W19739842392020 @default.
- W1973984239 countsByYear W19739842392022 @default.
- W1973984239 countsByYear W19739842392023 @default.
- W1973984239 crossrefType "journal-article" @default.
- W1973984239 hasAuthorship W1973984239A5000863924 @default.
- W1973984239 hasAuthorship W1973984239A5049356164 @default.
- W1973984239 hasAuthorship W1973984239A5066082409 @default.
- W1973984239 hasConcept C11413529 @default.
- W1973984239 hasConcept C126255220 @default.
- W1973984239 hasConcept C13743678 @default.
- W1973984239 hasConcept C154945302 @default.
- W1973984239 hasConcept C173801870 @default.
- W1973984239 hasConcept C33923547 @default.
- W1973984239 hasConcept C41008148 @default.
- W1973984239 hasConceptScore W1973984239C11413529 @default.
- W1973984239 hasConceptScore W1973984239C126255220 @default.
- W1973984239 hasConceptScore W1973984239C13743678 @default.
- W1973984239 hasConceptScore W1973984239C154945302 @default.
- W1973984239 hasConceptScore W1973984239C173801870 @default.
- W1973984239 hasConceptScore W1973984239C33923547 @default.
- W1973984239 hasConceptScore W1973984239C41008148 @default.
- W1973984239 hasIssue "3" @default.
- W1973984239 hasLocation W19739842391 @default.
- W1973984239 hasOpenAccess W1973984239 @default.
- W1973984239 hasPrimaryLocation W19739842391 @default.
- W1973984239 hasRelatedWork W1981277176 @default.
- W1973984239 hasRelatedWork W2034840381 @default.
- W1973984239 hasRelatedWork W2160313266 @default.
- W1973984239 hasRelatedWork W2320647101 @default.
- W1973984239 hasRelatedWork W2333698505 @default.
- W1973984239 hasRelatedWork W2351491280 @default.
- W1973984239 hasRelatedWork W2371447506 @default.
- W1973984239 hasRelatedWork W2386767533 @default.
- W1973984239 hasRelatedWork W303980170 @default.
- W1973984239 hasRelatedWork W4320016096 @default.
- W1973984239 hasVolume "91" @default.
- W1973984239 isParatext "false" @default.
- W1973984239 isRetracted "false" @default.
- W1973984239 magId "1973984239" @default.
- W1973984239 workType "article" @default.