Matches in SemOpenAlex for { <https://semopenalex.org/work/W4376607419> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W4376607419 endingPage "24" @default.
- W4376607419 startingPage "13" @default.
- W4376607419 abstract "We study the problem of computing a group of k vertices that covers a maximum number of shortest paths in a graph in the context of network centrality. In Group Coverage Centrality the input is an undirected graph G = (V, E) and the aim is to find a set S of κ vertices such that the number of vertex pairs {u,v} covered by S is at least t, if such a set exists. Here, S covers a vertex pair {u,v} if S contains at least one internal vertex of some shortest (u,v)-path. Also, we study All Pairs Coverage, the special case of Group Coverage Centrality where we want to cover at least one shortest path for all non-adjacent vertex pairs.We study the parameterized complexity of Group Coverage Centrality and All Pairs Coverage for the solution-size related parameters κ and |V| — κ, structural graph parameters, and t. On the negative side, we show that solution-size parameterizations do not lead to FPT-algorithms. On the positive side, we show that additionally considering structural parameters motivated from social network theory leads to FPT- algorithms for All Pairs Coverage and that Group Coverage Centrality admits FPT-algorithms for t and for t — k. On the practical side, we introduce several heuristics and compare their performance on standard benchmark graphs. We show that a greedy Set Cover- based heuristic gives almost-optimal results while a simple degree-based heuristic performs only slightly worse with a much better running time.*Work done while all authors were affiliated with Philipps-Universität Marburg, Germany. Some of the results of this work are also contained in the second author's Bachelor thesis [35]." @default.
- W4376607419 created "2023-05-17" @default.
- W4376607419 creator A5027185367 @default.
- W4376607419 creator A5091947132 @default.
- W4376607419 creator A5091947133 @default.
- W4376607419 date "2023-01-01" @default.
- W4376607419 modified "2023-09-25" @default.
- W4376607419 title "On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics" @default.
- W4376607419 doi "https://doi.org/10.1137/1.9781611977714.2" @default.
- W4376607419 hasPublicationYear "2023" @default.
- W4376607419 type Work @default.
- W4376607419 citedByCount "0" @default.
- W4376607419 crossrefType "book-chapter" @default.
- W4376607419 hasAuthorship W4376607419A5027185367 @default.
- W4376607419 hasAuthorship W4376607419A5091947132 @default.
- W4376607419 hasAuthorship W4376607419A5091947133 @default.
- W4376607419 hasConcept C114614502 @default.
- W4376607419 hasConcept C117045392 @default.
- W4376607419 hasConcept C118615104 @default.
- W4376607419 hasConcept C126255220 @default.
- W4376607419 hasConcept C127705205 @default.
- W4376607419 hasConcept C132525143 @default.
- W4376607419 hasConcept C165464430 @default.
- W4376607419 hasConcept C22590252 @default.
- W4376607419 hasConcept C3018234147 @default.
- W4376607419 hasConcept C33923547 @default.
- W4376607419 hasConcept C40687702 @default.
- W4376607419 hasConcept C41008148 @default.
- W4376607419 hasConcept C53811970 @default.
- W4376607419 hasConcept C80899671 @default.
- W4376607419 hasConceptScore W4376607419C114614502 @default.
- W4376607419 hasConceptScore W4376607419C117045392 @default.
- W4376607419 hasConceptScore W4376607419C118615104 @default.
- W4376607419 hasConceptScore W4376607419C126255220 @default.
- W4376607419 hasConceptScore W4376607419C127705205 @default.
- W4376607419 hasConceptScore W4376607419C132525143 @default.
- W4376607419 hasConceptScore W4376607419C165464430 @default.
- W4376607419 hasConceptScore W4376607419C22590252 @default.
- W4376607419 hasConceptScore W4376607419C3018234147 @default.
- W4376607419 hasConceptScore W4376607419C33923547 @default.
- W4376607419 hasConceptScore W4376607419C40687702 @default.
- W4376607419 hasConceptScore W4376607419C41008148 @default.
- W4376607419 hasConceptScore W4376607419C53811970 @default.
- W4376607419 hasConceptScore W4376607419C80899671 @default.
- W4376607419 hasLocation W43766074191 @default.
- W4376607419 hasOpenAccess W4376607419 @default.
- W4376607419 hasPrimaryLocation W43766074191 @default.
- W4376607419 hasRelatedWork W242849172 @default.
- W4376607419 hasRelatedWork W2763281487 @default.
- W4376607419 hasRelatedWork W2950011768 @default.
- W4376607419 hasRelatedWork W2950080395 @default.
- W4376607419 hasRelatedWork W2951881622 @default.
- W4376607419 hasRelatedWork W3110537131 @default.
- W4376607419 hasRelatedWork W4289985645 @default.
- W4376607419 hasRelatedWork W4294702976 @default.
- W4376607419 hasRelatedWork W4296270819 @default.
- W4376607419 hasRelatedWork W4300069928 @default.
- W4376607419 isParatext "false" @default.
- W4376607419 isRetracted "false" @default.
- W4376607419 workType "book-chapter" @default.