Image de couverture de livre

On the Complexity of Target Set Selection in Simple Geometric Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dvořák, Michal, Knop, Dušan, Schierreich, Šimon
Format:	Preprint
Publié:	2023
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Host Community Respecting Refugee Housing
par: Knop, Dušan, et autres
Publié: (2023)

Solving Multiagent Path Finding on Highly Centralized Networks
par: Fioravantes, Foivos, et autres
Publié: (2024)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
par: Fioravantes, Foivos, et autres
Publié: (2024)

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

Parameterized Critical Node Cut Revisited
par: Knop, Dušan, et autres
Publié: (2025)

A Quantum Pigeonhole Principle and Two Semidefinite Relaxations of Communication Complexity
par: Dvořák, Pavel, et autres
Publié: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
par: Dvořák, Pavel, et autres
Publié: (2017)

Balancing the Spread of Two Opinions in Sparse Social Networks
par: Knop, Dušan, et autres
Publié: (2021)

Hedonic Diversity Games: A Complexity Picture with More than Two Colors
par: Ganian, Robert, et autres
Publié: (2022)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
par: Przybyłek, Michał R., et autres
Publié: (2026)

Exponential Separation Between Powers of Regular and General Resolution Over Parities
par: Bhattacharya, Sreejata Kishor, et autres
Publié: (2024)

Generalized minimum 0-extension problem and discrete convexity
par: Dvorak, Martin, et autres
Publié: (2021)

Individual Rationality in Topological Distance Games is Surprisingly Hard
par: Deligkas, Argyrios, et autres
Publié: (2024)

The Parameterized Complexity of Geometric 1-Planarity
par: Firbas, Alexander
Publié: (2026)

FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
par: Chu, Huairui, et autres
Publié: (2023)

Optimal Proof Systems for Complex Sets are Hard to Find
par: Egidy, Fabian, et autres
Publié: (2024)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2025)

On the Complexity of Discounted Robust MDPs with $L_p$ Uncertainty Sets
par: Asadi, Ali, et autres
Publié: (2026)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
par: Knop, Dušan, et autres
Publié: (2017)

On the Complexity of Problems on Tree-structured Graphs
par: Bodlaender, Hans L., et autres
Publié: (2022)

The Complexity of Verifying Feedforward Neural Networks in Quantised Settings
par: Alsmann, Eric, et autres
Publié: (2026)

Practical approach to $2$-Euclidean Preferences
par: Dvořák, Michal, et autres
Publié: (2025)

Reachability In Simple Neural Networks
par: Sälzer, Marco, et autres
Publié: (2022)

Hexasort -- The Complexity of Stacking Colors on Graphs
par: Klocker, Linus, et autres
Publié: (2026)

Pathways to Tractability for Geometric Thickness
par: Depian, Thomas, et autres
Publié: (2024)

The Parameterized Complexity of Terminal Monitoring Set
par: Aravind, N. R., et autres
Publié: (2024)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
par: Shakiba, Yousef, et autres
Publié: (2025)

Refuting the Direct Sum Conjecture for Total Functions in Deterministic Communication Complexity
par: Mackenzie, Simon, et autres
Publié: (2024)

A Structural Complexity Analysis of Hierarchical Task Network Planning
par: Brand, Cornelius, et autres
Publié: (2024)

Additive Models Explained: A Computational Complexity Approach
par: Bassan, Shahaf, et autres
Publié: (2025)

Simple Circuit Extensions for XOR in PTIME
par: Carmosino, Marco, et autres
Publié: (2025)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
par: Bredereck, Robert, et autres
Publié: (2024)

Simple general magnification of circuit lower bounds
par: Atserias, Albert, et autres
Publié: (2025)

Set Descriptive Complexity of Solvable Functions
par: Gozzi, Riccardo, et autres
Publié: (2024)

NISQ Security and Complexity via Simple Classical Reasoning
par: Cojocaru, Alexandru, et autres
Publié: (2025)

Tight Inapproximability of Target Set Reconfiguration
par: Ohsaka, Naoto
Publié: (2024)

Hardness of SetCover Reoptimization
par: Jansen, Klaus, et autres
Publié: (2025)

Stability in Distance Preservation Games on Graphs
par: Deligkas, Argyrios, et autres
Publié: (2026)

Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness
par: Deligkas, Argyris, et autres
Publié: (2025)

Balanced and Fair Partitioning of Friends
par: Deligkas, Argyrios, et autres
Publié: (2025)