Matches in SemOpenAlex for { <https://semopenalex.org/work/W2963222815> ?p ?o ?g. }
Showing items 1 to 97 of
97
with 100 items per page.
- W2963222815 endingPage "217" @default.
- W2963222815 startingPage "205" @default.
- W2963222815 abstract "Path cover is a well-known intractable problem whose goal is to find a minimum number of vertex disjoint paths in a given graph to cover all the vertices. We show that a variant, where the objective function is not the number of paths but the number of length-0 paths (that is, isolated vertices), turns out to be polynomial-time solvable. We further show that another variant, where the objective function is the total number of length-0 and length-1 paths, is also polynomial-time solvable. Both variants find applications in approximating the two-machine flow-shop scheduling problem in which job processing constraints are formulated as a conflict graph. For the unit jobs, we present a 4/3-approximation algorithm for the scheduling problem with an arbitrary conflict graph, based on the exact algorithm for the variants of the path cover problem. For arbitrary jobs where the conflict graph is the union of two disjoint cliques (i.e., all the jobs can be partitioned into two groups such that the jobs in a group are pairwise conflicting), we present a simple 3/2-approximation algorithm." @default.
- W2963222815 created "2019-07-30" @default.
- W2963222815 creator A5001129320 @default.
- W2963222815 creator A5043628347 @default.
- W2963222815 creator A5055293711 @default.
- W2963222815 creator A5065710233 @default.
- W2963222815 creator A5085462851 @default.
- W2963222815 creator A5089344475 @default.
- W2963222815 creator A5091866119 @default.
- W2963222815 date "2018-01-01" @default.
- W2963222815 modified "2023-09-23" @default.
- W2963222815 title "Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph" @default.
- W2963222815 cites W1488422606 @default.
- W2963222815 cites W1967955864 @default.
- W2963222815 cites W1973911168 @default.
- W2963222815 cites W1975963573 @default.
- W2963222815 cites W2007315235 @default.
- W2963222815 cites W2008816808 @default.
- W2963222815 cites W2013937449 @default.
- W2963222815 cites W2019977411 @default.
- W2963222815 cites W2024085737 @default.
- W2963222815 cites W2024742034 @default.
- W2963222815 cites W2035754921 @default.
- W2963222815 cites W2049181186 @default.
- W2963222815 cites W2060774395 @default.
- W2963222815 cites W2087615244 @default.
- W2963222815 cites W2087818742 @default.
- W2963222815 cites W2088522084 @default.
- W2963222815 cites W2095381673 @default.
- W2963222815 cites W2103659156 @default.
- W2963222815 cites W2132624129 @default.
- W2963222815 cites W2154305205 @default.
- W2963222815 cites W2157846217 @default.
- W2963222815 cites W2472999647 @default.
- W2963222815 cites W2631032937 @default.
- W2963222815 cites W2913829344 @default.
- W2963222815 cites W3161056635 @default.
- W2963222815 cites W4242310348 @default.
- W2963222815 doi "https://doi.org/10.1007/978-3-319-94776-1_18" @default.
- W2963222815 hasPublicationYear "2018" @default.
- W2963222815 type Work @default.
- W2963222815 sameAs 2963222815 @default.
- W2963222815 citedByCount "1" @default.
- W2963222815 countsByYear W29632228152021 @default.
- W2963222815 crossrefType "book-chapter" @default.
- W2963222815 hasAuthorship W2963222815A5001129320 @default.
- W2963222815 hasAuthorship W2963222815A5043628347 @default.
- W2963222815 hasAuthorship W2963222815A5055293711 @default.
- W2963222815 hasAuthorship W2963222815A5065710233 @default.
- W2963222815 hasAuthorship W2963222815A5085462851 @default.
- W2963222815 hasAuthorship W2963222815A5089344475 @default.
- W2963222815 hasAuthorship W2963222815A5091866119 @default.
- W2963222815 hasBestOaLocation W29632228152 @default.
- W2963222815 hasConcept C111919701 @default.
- W2963222815 hasConcept C11413529 @default.
- W2963222815 hasConcept C126255220 @default.
- W2963222815 hasConcept C132525143 @default.
- W2963222815 hasConcept C158336966 @default.
- W2963222815 hasConcept C173608175 @default.
- W2963222815 hasConcept C206729178 @default.
- W2963222815 hasConcept C33923547 @default.
- W2963222815 hasConcept C41008148 @default.
- W2963222815 hasConcept C55416958 @default.
- W2963222815 hasConcept C68387754 @default.
- W2963222815 hasConcept C80444323 @default.
- W2963222815 hasConceptScore W2963222815C111919701 @default.
- W2963222815 hasConceptScore W2963222815C11413529 @default.
- W2963222815 hasConceptScore W2963222815C126255220 @default.
- W2963222815 hasConceptScore W2963222815C132525143 @default.
- W2963222815 hasConceptScore W2963222815C158336966 @default.
- W2963222815 hasConceptScore W2963222815C173608175 @default.
- W2963222815 hasConceptScore W2963222815C206729178 @default.
- W2963222815 hasConceptScore W2963222815C33923547 @default.
- W2963222815 hasConceptScore W2963222815C41008148 @default.
- W2963222815 hasConceptScore W2963222815C55416958 @default.
- W2963222815 hasConceptScore W2963222815C68387754 @default.
- W2963222815 hasConceptScore W2963222815C80444323 @default.
- W2963222815 hasLocation W29632228151 @default.
- W2963222815 hasLocation W29632228152 @default.
- W2963222815 hasOpenAccess W2963222815 @default.
- W2963222815 hasPrimaryLocation W29632228151 @default.
- W2963222815 hasRelatedWork W1544003896 @default.
- W2963222815 hasRelatedWork W2011084017 @default.
- W2963222815 hasRelatedWork W2013750676 @default.
- W2963222815 hasRelatedWork W2031485694 @default.
- W2963222815 hasRelatedWork W2031613569 @default.
- W2963222815 hasRelatedWork W2400050947 @default.
- W2963222815 hasRelatedWork W2562877900 @default.
- W2963222815 hasRelatedWork W2963688429 @default.
- W2963222815 hasRelatedWork W3108825117 @default.
- W2963222815 hasRelatedWork W8282516 @default.
- W2963222815 isParatext "false" @default.
- W2963222815 isRetracted "false" @default.
- W2963222815 magId "2963222815" @default.
- W2963222815 workType "book-chapter" @default.