Pervasive domination

DOI10.1007/978-3-031-18530-4_21zbMath1528.90265MaRDI QIDQ6166909

Adele A. Rescigno, Luisa Gargano, Gennaro Cordasco

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

domination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithm for partial positive influence problem in social network
• A note on maximizing a submodular set function subject to a knapsack constraint
• Active influence spreading in social networks
• The computational difficulty of manipulating an election
• An analysis of the greedy algorithm for the submodular set covering problem
• On the approximability and exact algorithms for vector domination and related problems in graphs
• Whom to befriend to influence people
• Fast and frugal targeting with incentives
• Dual Domination
• Influence Diffusion in Social Networks under Time Window Constraints
• How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation
• A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks
• Evangelism in social networks: Algorithms and complexity
• Control and Bribery in Voting

This page was built for publication: Pervasive domination