One-way Communication Complexity of Minimum Vertex Cover in General Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Derakhshan, Mahsa, Ghasemi, Andisheh, Rajaraman, Rajmohan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the Complexity of Vertex-Splitting Into an Interval Graph
by: Abu-Khzam, Faisal N., et al.
Published: (2026)
by: Abu-Khzam, Faisal N., et al.
Published: (2026)
Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
by: Bhargav, Jayanth, et al.
Published: (2024)
by: Bhargav, Jayanth, et al.
Published: (2024)
On the Complexity of Claw-Free Vertex Splitting
by: Abu-Khzam, Faisal N., et al.
Published: (2025)
by: Abu-Khzam, Faisal N., et al.
Published: (2025)
The Parameterized Complexity of Computing the Linear Vertex Arboricity
by: Erhardt, Alexander, et al.
Published: (2025)
by: Erhardt, Alexander, et al.
Published: (2025)
Approximation Algorithms for Action-Reward Query-Commit Matching
by: Derakhshan, Mahsa, et al.
Published: (2026)
by: Derakhshan, Mahsa, et al.
Published: (2026)
Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
by: Herrmann, Anton, et al.
Published: (2025)
by: Herrmann, Anton, et al.
Published: (2025)
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
by: Firbas, Alexander, et al.
Published: (2024)
by: Firbas, Alexander, et al.
Published: (2024)
Reachability of Independent Sets and Vertex Covers Under Extended Reconfiguration Rules
by: Hirahara, Shuichi, et al.
Published: (2025)
by: Hirahara, Shuichi, et al.
Published: (2025)
One-Way Communication Complexity of Partial XOR Functions
by: Podolskii, Vladimir V., et al.
Published: (2023)
by: Podolskii, Vladimir V., et al.
Published: (2023)
On the Descriptive Complexity of Vertex Deletion Problems
by: Bannach, Max, et al.
Published: (2024)
by: Bannach, Max, et al.
Published: (2024)
Knapsack with Vertex Cover, Set Cover, and Hitting Set
by: Dey, Palash, et al.
Published: (2024)
by: Dey, Palash, et al.
Published: (2024)
Parameterized Capacitated Vertex Cover Revisited
by: Lampis, Michael, et al.
Published: (2026)
by: Lampis, Michael, et al.
Published: (2026)
Computing Subset Vertex Covers in $H$-Free Graphs
by: Brettell, Nick, et al.
Published: (2023)
by: Brettell, Nick, et al.
Published: (2023)
The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)
by: Calamoneri, Tiziana, et al.
Published: (2025)
Exact Algorithms for Distance to Unique Vertex Cover
by: Fioravantes, Foivos, et al.
Published: (2025)
by: Fioravantes, Foivos, et al.
Published: (2025)
Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
by: Abu-Khzam, Faisal N., et al.
Published: (2024)
by: Abu-Khzam, Faisal N., et al.
Published: (2024)
Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
by: Manna, Bubai
Published: (2025)
by: Manna, Bubai
Published: (2025)
Submodular Information Selection for Hypothesis Testing with Misclassification Penalties
by: Bhargav, Jayanth, et al.
Published: (2024)
by: Bhargav, Jayanth, et al.
Published: (2024)
Minimum Selective Subset on Some Graph Classes
by: Manna, Bubai
Published: (2025)
by: Manna, Bubai
Published: (2025)
A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
by: Clinch, Katie, et al.
Published: (2025)
by: Clinch, Katie, et al.
Published: (2025)
On the Complexity of 2-club Cluster Editing with Vertex Splitting
by: Abu-Khzam, Faisal N., et al.
Published: (2024)
by: Abu-Khzam, Faisal N., et al.
Published: (2024)
The Complexity of Cluster Vertex Splitting and Company
by: Firbas, Alexander, et al.
Published: (2023)
by: Firbas, Alexander, et al.
Published: (2023)
A Complexity Analysis of the c-Closed Vertex Deletion Problem
by: Lehner, Lisa, et al.
Published: (2025)
by: Lehner, Lisa, et al.
Published: (2025)
New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model
by: Fan, Austen, et al.
Published: (2026)
by: Fan, Austen, et al.
Published: (2026)
Pseudodeterministic Communication Complexity
by: Göös, Mika, et al.
Published: (2025)
by: Göös, Mika, et al.
Published: (2025)
Parameterized Complexity of Fair Many-to-One Matchings
by: Javadi, Ramin, et al.
Published: (2024)
by: Javadi, Ramin, et al.
Published: (2024)
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
by: Foucaud, Florent, et al.
Published: (2024)
by: Foucaud, Florent, et al.
Published: (2024)
Boolean Circuit Complexity and Two-Dimensional Cover Problems
by: Cavalar, Bruno P., et al.
Published: (2025)
by: Cavalar, Bruno P., et al.
Published: (2025)
Structure in Communication Complexity and Constant-Cost Complexity Classes
by: Hatami, Hamed, et al.
Published: (2024)
by: Hatami, Hamed, et al.
Published: (2024)
The Parameterized Complexity of Vertex-Coloring Edge-Weighting
by: Aute, Shubhada, et al.
Published: (2026)
by: Aute, Shubhada, et al.
Published: (2026)
On Stable Cutsets in General and Minimum Degree Constrained Graphs
by: Vroon, Mats, et al.
Published: (2025)
by: Vroon, Mats, et al.
Published: (2025)
Communication Complexity is NP-hard
by: Hirahara, Shuichi, et al.
Published: (2025)
by: Hirahara, Shuichi, et al.
Published: (2025)
The Computational Complexity of Factored Graphs
by: Gupta, Shreya, et al.
Published: (2024)
by: Gupta, Shreya, et al.
Published: (2024)
Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
by: Tale, Prafullkumar
Published: (2025)
by: Tale, Prafullkumar
Published: (2025)
A Hierarchy for Constant Communication Complexity
by: Ambainis, Andris, et al.
Published: (2025)
by: Ambainis, Andris, et al.
Published: (2025)
An XOR Lemma for Deterministic Communication Complexity
by: Iyer, Siddharth, et al.
Published: (2024)
by: Iyer, Siddharth, et al.
Published: (2024)
Multiparty Communication Complexity of Collision Finding
by: Beame, Paul, et al.
Published: (2024)
by: Beame, Paul, et al.
Published: (2024)
Optimal Communication Complexity of Chained Index
by: Sundaresan, Janani
Published: (2024)
by: Sundaresan, Janani
Published: (2024)
The Parameterized Complexity of Coloring Mixed Graphs
by: Lauerbach, Antonio, et al.
Published: (2026)
by: Lauerbach, Antonio, et al.
Published: (2026)
On the Complexity of Problems on Tree-structured Graphs
by: Bodlaender, Hans L., et al.
Published: (2022)
by: Bodlaender, Hans L., et al.
Published: (2022)
Similar Items
-
On the Complexity of Vertex-Splitting Into an Interval Graph
by: Abu-Khzam, Faisal N., et al.
Published: (2026) -
Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
by: Bhargav, Jayanth, et al.
Published: (2024) -
On the Complexity of Claw-Free Vertex Splitting
by: Abu-Khzam, Faisal N., et al.
Published: (2025) -
The Parameterized Complexity of Computing the Linear Vertex Arboricity
by: Erhardt, Alexander, et al.
Published: (2025) -
Approximation Algorithms for Action-Reward Query-Commit Matching
by: Derakhshan, Mahsa, et al.
Published: (2026)