Matches in SemOpenAlex for { <https://semopenalex.org/work/W4386891736> ?p ?o ?g. }
Showing items 1 to 66 of
66
with 100 items per page.
- W4386891736 endingPage "145" @default.
- W4386891736 startingPage "134" @default.
- W4386891736 abstract "In clustering problems, one has to partition a given set of objects into pairwise disjoint subsets (clusters) taking into account only similarity of objects. In the graph cluster editing problem similarity relation on the set of objects is given by an undirected graph whose vertices are in one-to-one correspondence with objects and edges correspond to pairs of similar objects. The goal is to find a nearest to a given graph $$G=(V,E)$$ cluster graph, i.e., a graph on the vertex set V each connected component of which is a complete graph. The distance between graphs is understood as the Hamming distance between their incidence vectors. We consider a variant of the cluster editing problem in which the size of each cluster is bounded from above by a positive integer s. In 2011, Il’ev and Navrotskaya proved that this problem is NP-hard for any fixed $$s geqslant 3$$ . In 2015, Puleo and Milenkovic proposed a 6-approximation algorithm for this problem. In 2016, Il’ev, Il’eva and Navrotskaya presented an approximation algorithm that is 3-approximation in case of $$s=3$$ and 5-approximation in case of $$s=4$$ . Now we propose simple greedy-type 2-approximation algorithms for these cases with tight performance guarantees." @default.
- W4386891736 created "2023-09-21" @default.
- W4386891736 creator A5001009462 @default.
- W4386891736 creator A5057430885 @default.
- W4386891736 date "2023-01-01" @default.
- W4386891736 modified "2023-09-27" @default.
- W4386891736 title "Approximation Algorithms for Graph Cluster Editing Problems with Cluster Size at Most 3 and 4" @default.
- W4386891736 cites W1958024236 @default.
- W4386891736 cites W2007581650 @default.
- W4386891736 cites W2024270272 @default.
- W4386891736 cites W2049241046 @default.
- W4386891736 cites W2107223449 @default.
- W4386891736 cites W2507375894 @default.
- W4386891736 cites W2557527491 @default.
- W4386891736 cites W2611831635 @default.
- W4386891736 cites W2914959486 @default.
- W4386891736 cites W2967003966 @default.
- W4386891736 doi "https://doi.org/10.1007/978-3-031-43257-6_11" @default.
- W4386891736 hasPublicationYear "2023" @default.
- W4386891736 type Work @default.
- W4386891736 citedByCount "0" @default.
- W4386891736 crossrefType "book-chapter" @default.
- W4386891736 hasAuthorship W4386891736A5001009462 @default.
- W4386891736 hasAuthorship W4386891736A5057430885 @default.
- W4386891736 hasConcept C11413529 @default.
- W4386891736 hasConcept C114614502 @default.
- W4386891736 hasConcept C118615104 @default.
- W4386891736 hasConcept C132525143 @default.
- W4386891736 hasConcept C134306372 @default.
- W4386891736 hasConcept C148764684 @default.
- W4386891736 hasConcept C193435613 @default.
- W4386891736 hasConcept C203776342 @default.
- W4386891736 hasConcept C33923547 @default.
- W4386891736 hasConcept C34388435 @default.
- W4386891736 hasConcept C45340560 @default.
- W4386891736 hasConcept C80899671 @default.
- W4386891736 hasConceptScore W4386891736C11413529 @default.
- W4386891736 hasConceptScore W4386891736C114614502 @default.
- W4386891736 hasConceptScore W4386891736C118615104 @default.
- W4386891736 hasConceptScore W4386891736C132525143 @default.
- W4386891736 hasConceptScore W4386891736C134306372 @default.
- W4386891736 hasConceptScore W4386891736C148764684 @default.
- W4386891736 hasConceptScore W4386891736C193435613 @default.
- W4386891736 hasConceptScore W4386891736C203776342 @default.
- W4386891736 hasConceptScore W4386891736C33923547 @default.
- W4386891736 hasConceptScore W4386891736C34388435 @default.
- W4386891736 hasConceptScore W4386891736C45340560 @default.
- W4386891736 hasConceptScore W4386891736C80899671 @default.
- W4386891736 hasLocation W43868917361 @default.
- W4386891736 hasOpenAccess W4386891736 @default.
- W4386891736 hasPrimaryLocation W43868917361 @default.
- W4386891736 hasRelatedWork W2022054586 @default.
- W4386891736 hasRelatedWork W2368524975 @default.
- W4386891736 hasRelatedWork W2770134917 @default.
- W4386891736 hasRelatedWork W2940821404 @default.
- W4386891736 hasRelatedWork W2998932593 @default.
- W4386891736 hasRelatedWork W3033876040 @default.
- W4386891736 hasRelatedWork W3109685666 @default.
- W4386891736 hasRelatedWork W3185918591 @default.
- W4386891736 hasRelatedWork W4206244388 @default.
- W4386891736 hasRelatedWork W4296581269 @default.
- W4386891736 isParatext "false" @default.
- W4386891736 isRetracted "false" @default.
- W4386891736 workType "book-chapter" @default.