Matches in SemOpenAlex for { <https://semopenalex.org/work/W1597139733> ?p ?o ?g. }
- W1597139733 endingPage "245" @default.
- W1597139733 startingPage "238" @default.
- W1597139733 abstract "In this article, a heuristic is said to be provably best if, assuming , no other heuristic always finds a better solution (when one exists). This extends the usual notion of “best possible” approximation algorithms to include a larger class of heuristics. We illustrate the idea on several problems that are somewhat stylized versions of real‐life network optimization problems, including the maximum clique, maximum k ‐club, minimum (connected) dominating set, and minimum vertex coloring problems. The corresponding provably best construction heuristics resemble those commonly used within popular metaheuristics. Along the way, we show that it is hard to recognize whether the clique number and the k ‐club number of a graph are equal, yet a polynomial‐time computable function is “sandwiched” between them. This is similar to the celebrated Lovász function wherein an efficiently computable function lies between two graph invariants that are ‐hard to compute. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 67(3), 238–245 2016" @default.
- W1597139733 created "2016-06-24" @default.
- W1597139733 creator A5006813161 @default.
- W1597139733 creator A5021722411 @default.
- W1597139733 creator A5029500446 @default.
- W1597139733 creator A5057562290 @default.
- W1597139733 date "2015-07-01" @default.
- W1597139733 modified "2023-10-14" @default.
- W1597139733 title "On provably best construction heuristics for hard combinatorial optimization problems" @default.
- W1597139733 cites W1499595654 @default.
- W1597139733 cites W1548134571 @default.
- W1597139733 cites W1576895581 @default.
- W1597139733 cites W1970871468 @default.
- W1597139733 cites W1980096229 @default.
- W1597139733 cites W1981455469 @default.
- W1597139733 cites W1986203294 @default.
- W1597139733 cites W1986997293 @default.
- W1597139733 cites W1989737163 @default.
- W1597139733 cites W1991728994 @default.
- W1597139733 cites W2004181701 @default.
- W1597139733 cites W2007033386 @default.
- W1597139733 cites W2010661649 @default.
- W1597139733 cites W2026320281 @default.
- W1597139733 cites W2030087828 @default.
- W1597139733 cites W2035372875 @default.
- W1597139733 cites W2039568841 @default.
- W1597139733 cites W2045574977 @default.
- W1597139733 cites W2046112356 @default.
- W1597139733 cites W2057950320 @default.
- W1597139733 cites W2065590056 @default.
- W1597139733 cites W2073583237 @default.
- W1597139733 cites W2074645046 @default.
- W1597139733 cites W2078289947 @default.
- W1597139733 cites W2081254453 @default.
- W1597139733 cites W2082603400 @default.
- W1597139733 cites W2086917808 @default.
- W1597139733 cites W2089494972 @default.
- W1597139733 cites W2092292680 @default.
- W1597139733 cites W2092501917 @default.
- W1597139733 cites W2100978151 @default.
- W1597139733 cites W2117942072 @default.
- W1597139733 cites W2136955214 @default.
- W1597139733 cites W2148948822 @default.
- W1597139733 cites W2401610261 @default.
- W1597139733 cites W2997776631 @default.
- W1597139733 cites W4293860921 @default.
- W1597139733 cites W564518845 @default.
- W1597139733 cites W80045804 @default.
- W1597139733 doi "https://doi.org/10.1002/net.21620" @default.
- W1597139733 hasPublicationYear "2015" @default.
- W1597139733 type Work @default.
- W1597139733 sameAs 1597139733 @default.
- W1597139733 citedByCount "10" @default.
- W1597139733 countsByYear W15971397332015 @default.
- W1597139733 countsByYear W15971397332017 @default.
- W1597139733 countsByYear W15971397332018 @default.
- W1597139733 countsByYear W15971397332019 @default.
- W1597139733 countsByYear W15971397332020 @default.
- W1597139733 countsByYear W15971397332022 @default.
- W1597139733 crossrefType "journal-article" @default.
- W1597139733 hasAuthorship W1597139733A5006813161 @default.
- W1597139733 hasAuthorship W1597139733A5021722411 @default.
- W1597139733 hasAuthorship W1597139733A5029500446 @default.
- W1597139733 hasAuthorship W1597139733A5057562290 @default.
- W1597139733 hasConcept C109718341 @default.
- W1597139733 hasConcept C114614502 @default.
- W1597139733 hasConcept C118615104 @default.
- W1597139733 hasConcept C126255220 @default.
- W1597139733 hasConcept C127705205 @default.
- W1597139733 hasConcept C132525143 @default.
- W1597139733 hasConcept C165464430 @default.
- W1597139733 hasConcept C173801870 @default.
- W1597139733 hasConcept C2777035058 @default.
- W1597139733 hasConcept C2983226441 @default.
- W1597139733 hasConcept C311688 @default.
- W1597139733 hasConcept C33923547 @default.
- W1597139733 hasConcept C41008148 @default.
- W1597139733 hasConcept C80899671 @default.
- W1597139733 hasConceptScore W1597139733C109718341 @default.
- W1597139733 hasConceptScore W1597139733C114614502 @default.
- W1597139733 hasConceptScore W1597139733C118615104 @default.
- W1597139733 hasConceptScore W1597139733C126255220 @default.
- W1597139733 hasConceptScore W1597139733C127705205 @default.
- W1597139733 hasConceptScore W1597139733C132525143 @default.
- W1597139733 hasConceptScore W1597139733C165464430 @default.
- W1597139733 hasConceptScore W1597139733C173801870 @default.
- W1597139733 hasConceptScore W1597139733C2777035058 @default.
- W1597139733 hasConceptScore W1597139733C2983226441 @default.
- W1597139733 hasConceptScore W1597139733C311688 @default.
- W1597139733 hasConceptScore W1597139733C33923547 @default.
- W1597139733 hasConceptScore W1597139733C41008148 @default.
- W1597139733 hasConceptScore W1597139733C80899671 @default.
- W1597139733 hasFunder F4320338279 @default.
- W1597139733 hasIssue "3" @default.
- W1597139733 hasLocation W15971397331 @default.
- W1597139733 hasOpenAccess W1597139733 @default.
- W1597139733 hasPrimaryLocation W15971397331 @default.
- W1597139733 hasRelatedWork W1649663665 @default.