Matches in SemOpenAlex for { <https://semopenalex.org/work/W2182662656> ?p ?o ?g. }
- W2182662656 endingPage "81" @default.
- W2182662656 startingPage "69" @default.
- W2182662656 abstract "We consider a connected graph G with n vertices, p of which are centers, while the remaining ones are units. For each unit-center pair, there is a fixed assignment cost and for each vertex there is a nonnegative weight. In this article, we study the problem of partitioning G into p connected components such that each component contains exactly one center p-centered partition. We analyze different optimization problems of this type by defining different objective functions based on the assignment costs, or on the vertices' weights, or on both of them. For these problems, we show that they are NP-hard on very special classes of graphs, and for some of them we provide polynomial time algorithms when G is a tree. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 671, 69-81 2016" @default.
- W2182662656 created "2016-06-24" @default.
- W2182662656 creator A5004276088 @default.
- W2182662656 creator A5013493866 @default.
- W2182662656 creator A5014275138 @default.
- W2182662656 creator A5088287025 @default.
- W2182662656 date "2015-10-16" @default.
- W2182662656 modified "2023-10-04" @default.
- W2182662656 title "Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria" @default.
- W2182662656 cites W1497411480 @default.
- W2182662656 cites W1537800435 @default.
- W2182662656 cites W183477766 @default.
- W2182662656 cites W1967968533 @default.
- W2182662656 cites W1969849690 @default.
- W2182662656 cites W1970194957 @default.
- W2182662656 cites W1971680805 @default.
- W2182662656 cites W1977623721 @default.
- W2182662656 cites W1980633086 @default.
- W2182662656 cites W1984996036 @default.
- W2182662656 cites W1989256614 @default.
- W2182662656 cites W1990080641 @default.
- W2182662656 cites W1990489976 @default.
- W2182662656 cites W1993150073 @default.
- W2182662656 cites W1996528031 @default.
- W2182662656 cites W2004039823 @default.
- W2182662656 cites W2009619919 @default.
- W2182662656 cites W2016332468 @default.
- W2182662656 cites W2041571997 @default.
- W2182662656 cites W2053400346 @default.
- W2182662656 cites W2063488705 @default.
- W2182662656 cites W2067928043 @default.
- W2182662656 cites W2068625005 @default.
- W2182662656 cites W2073247434 @default.
- W2182662656 cites W2073263174 @default.
- W2182662656 cites W2077960662 @default.
- W2182662656 cites W2088087163 @default.
- W2182662656 cites W2103985627 @default.
- W2182662656 cites W2116539775 @default.
- W2182662656 cites W2119865296 @default.
- W2182662656 cites W2124993079 @default.
- W2182662656 cites W2141505357 @default.
- W2182662656 cites W2151422385 @default.
- W2182662656 cites W2156680550 @default.
- W2182662656 cites W2167696076 @default.
- W2182662656 cites W4233672487 @default.
- W2182662656 cites W4293860921 @default.
- W2182662656 cites W4300194497 @default.
- W2182662656 doi "https://doi.org/10.1002/net.21661" @default.
- W2182662656 hasPublicationYear "2015" @default.
- W2182662656 type Work @default.
- W2182662656 sameAs 2182662656 @default.
- W2182662656 citedByCount "13" @default.
- W2182662656 countsByYear W21826626562016 @default.
- W2182662656 countsByYear W21826626562018 @default.
- W2182662656 countsByYear W21826626562019 @default.
- W2182662656 countsByYear W21826626562020 @default.
- W2182662656 countsByYear W21826626562021 @default.
- W2182662656 countsByYear W21826626562022 @default.
- W2182662656 crossrefType "journal-article" @default.
- W2182662656 hasAuthorship W2182662656A5004276088 @default.
- W2182662656 hasAuthorship W2182662656A5013493866 @default.
- W2182662656 hasAuthorship W2182662656A5014275138 @default.
- W2182662656 hasAuthorship W2182662656A5088287025 @default.
- W2182662656 hasConcept C114614502 @default.
- W2182662656 hasConcept C115260700 @default.
- W2182662656 hasConcept C121332964 @default.
- W2182662656 hasConcept C126255220 @default.
- W2182662656 hasConcept C132525143 @default.
- W2182662656 hasConcept C162324750 @default.
- W2182662656 hasConcept C175444787 @default.
- W2182662656 hasConcept C193435613 @default.
- W2182662656 hasConcept C33923547 @default.
- W2182662656 hasConcept C41008148 @default.
- W2182662656 hasConcept C42866809 @default.
- W2182662656 hasConcept C62520636 @default.
- W2182662656 hasConcept C99742106 @default.
- W2182662656 hasConceptScore W2182662656C114614502 @default.
- W2182662656 hasConceptScore W2182662656C115260700 @default.
- W2182662656 hasConceptScore W2182662656C121332964 @default.
- W2182662656 hasConceptScore W2182662656C126255220 @default.
- W2182662656 hasConceptScore W2182662656C132525143 @default.
- W2182662656 hasConceptScore W2182662656C162324750 @default.
- W2182662656 hasConceptScore W2182662656C175444787 @default.
- W2182662656 hasConceptScore W2182662656C193435613 @default.
- W2182662656 hasConceptScore W2182662656C33923547 @default.
- W2182662656 hasConceptScore W2182662656C41008148 @default.
- W2182662656 hasConceptScore W2182662656C42866809 @default.
- W2182662656 hasConceptScore W2182662656C62520636 @default.
- W2182662656 hasConceptScore W2182662656C99742106 @default.
- W2182662656 hasFunder F4320323737 @default.
- W2182662656 hasFunder F4320326754 @default.
- W2182662656 hasIssue "1" @default.
- W2182662656 hasLocation W21826626561 @default.
- W2182662656 hasOpenAccess W2182662656 @default.
- W2182662656 hasPrimaryLocation W21826626561 @default.
- W2182662656 hasRelatedWork W159748213 @default.
- W2182662656 hasRelatedWork W1978042415 @default.
- W2182662656 hasRelatedWork W2005300355 @default.