Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMay 2024
Fair Surveillance Assignment Problem
WWW '24: Proceedings of the ACM Web Conference 2024Pages 178–186https://doi.org/10.1145/3589334.3645613Monitoring a specific set of locations serves multiple purposes, such as infrastructure inspection and safety surveillance. We study a generalization of the surveillance problem, where the monitoring area, represented by a graph, is divided and assigned ...
- research-articleAugust 2023
Fixed-Parameter Tractability of the (1 + 1) Evolutionary Algorithm on Random Planted Vertex Covers
FOGA '23: Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic AlgorithmsPages 96–104https://doi.org/10.1145/3594805.3607134We present the first parameterized analysis of a standard (1+1) Evolutionary Algorithm on a distribution of vertex cover problems. We show that if the planted cover is at most logarithmic, restarting the (1+1) EA every O(n log n) steps will find a cover ...
- ArticleJune 2023
Approximating Power Node-Deletion Problems
AbstractIn the Power Vertex Cover (PVC) problem introduced in [1] as a generalization of the well-known Vertex Cover, we are allowed to specify costs for covering edges in a graph individually. Namely, two weights, , are associated with each “edge” of ...
- research-articleOctober 2022
A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties
Frontiers of Computer Science: Selected Publications from Chinese Universities (FCS), Volume 17, Issue 3https://doi.org/10.1007/s11704-022-1665-9AbstractIn this paper, we consider the k-prize-collecting minimum vertex cover problem with submodular penalties, which generalizes the well-known minimum vertex cover problem, minimum partial vertex cover problem and minimum vertex cover problem with ...
- research-articleJuly 2022
Analysis of a gray-box operator for vertex cover
GECCO '22: Proceedings of the Genetic and Evolutionary Computation ConferencePages 1363–1371https://doi.org/10.1145/3512290.3528848Combinatorial optimization problems are a prominent application area of evolutionary algorithms, where the (1+1) EA is one of the most investigated. We extend this algorithm by introducing some problem knowledge with a specialized mutation operator which ...
-
- research-articleJanuary 2022
Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel
SIAM Journal on Discrete Mathematics (SIDMA), Volume 36, Issue 4Pages 2737–2773https://doi.org/10.1137/21M1400766We study the kernelization complexity of structural parameterizations of the Vertex Cover problem. Here, the goal is to find a polynomial-time preprocessing algorithm that can reduce any instance $(G,k)$ of the Vertex Cover problem to an equivalent one, ...
- research-articleOctober 2021
An Updated Experimental Evaluation of Graph Bipartization Methods
ACM Journal of Experimental Algorithmics (JEA), Volume 26Article No.: 12, Pages 1–24https://doi.org/10.1145/3467968We experimentally evaluate the practical state-of-the-art in graph bipartization (Odd Cycle Transversal (OCT)), motivated by the need for good algorithms for embedding problems into near-term quantum computing hardware. We assemble a preprocessing suite ...
- research-articleApril 2021
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
ACM Journal of Experimental Algorithmics (JEA), Volume 26Article No.: 1.3, Pages 1–30https://doi.org/10.1145/3439801Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For n-vertex and m-edge graphs, the best-known algorithms run in Õ(m√ n) time. We build on ...
- research-articleJanuary 2021
On structural parameterizations of the selective coloring problem
Procedia Computer Science (PROCS), Volume 195, Issue CPages 77–85https://doi.org/10.1016/j.procs.2021.11.013AbstractIn the Selective Coloring problem, we are given an integer k, a graph G, and a partition of V(G) into p parts, and the goal is to decide whether or not we can pick exactly one vertex of each part and obtain a k-colorable induced subgraph of G. ...
- research-articleJanuary 2021
Parameterized algorithms for locating-dominating sets
Procedia Computer Science (PROCS), Volume 195, Issue CPages 68–76https://doi.org/10.1016/j.procs.2021.11.012AbstractA locating-dominating set D of a graph G is a dominating set of G where each vertex not in D has a unique neighborhood in D, and the Locating-Dominating Set problem asks if G contains such a dominating set of bounded size. This problem is known to ...
- research-articleJanuary 2021
Kernelization results for Equitable Coloring
Procedia Computer Science (PROCS), Volume 195, Issue CPages 59–67https://doi.org/10.1016/j.procs.2021.11.011AbstractAn n-vertex graph is equitably k-colorable if there is a proper coloring of its vertices such that each color is used either [n/k] or [n/k] times. While classic Vertex Coloring is fixed parameter tractable under well established parameters such as ...
- research-articleJune 2020
Why Is Maximum Clique Often Easy in Practice?
Jose L. Walteros and Austin Buchanan
This paper focuses on providing a rigorous, worst-case explanation for why the maximum clique problem is apparently so easy in naturally occurring graphs, despite its intractability in the worst case. To this day, there exist unsolved benchmark instances ...
To this day, the maximum clique problem remains a computationally challenging problem. Indeed, despite researchers’ best efforts, there exist unsolved benchmark instances with 1,000 vertices. However, relatively simple algorithms solve real-life instances ...
- abstractJuly 2019
Optimal Distributed Covering Algorithms
PODC '19: Proceedings of the 2019 ACM Symposium on Principles of Distributed ComputingPages 104–106https://doi.org/10.1145/3293611.3331577We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank ƒ. This problem is equivalent to the Minimum Weight Set Cover problem in which the frequency of every element is bounded ...
- research-articleFebruary 2019
No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
Mathematics of Operations Research (MOOR), Volume 44, Issue 1Pages 147–172https://doi.org/10.1287/moor.2017.0918The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev [Khot S, Regev O (2008) Vertex cover might be hard to approximate to within 2 − ɛ. J. Comput. System Sci. 74(3):335–349] ...
- research-articleJanuary 2019
Rank Vertex Cover as a Natural Problem for Algebraic Compression
SIAM Journal on Discrete Mathematics (SIDMA), Volume 33, Issue 3Pages 1277–1296https://doi.org/10.1137/17M1154370The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem was a long-standing, notorious open problem in parameterized complexity. Some years ago, the breakthrough work by Kratsch and Wahlström on representative sets ...
- research-articleOctober 2018
The Complexity of Independent Set Reconfiguration on Bipartite Graphs
ACM Transactions on Algorithms (TALG), Volume 15, Issue 1Article No.: 7, Pages 1–19https://doi.org/10.1145/3280825We settle the complexity of the Independent Set Reconfiguration problem on bipartite graphs under all three commonly studied reconfiguration models. We show that under the token jumping or token addition/removal model, the problem is NP-complete. For ...
- research-articleJuly 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingPages 129–138https://doi.org/10.1145/3212734.3212743We present O(loglog n) -round algorithms in the Massively Parallel Computation (MPC) model, with Õ (n) memory per machine, that compute a maximal independent set, a 1+ε approximation of maximum matching, and a 2+εapproximation of minimum vertex cover, ...
- research-articleJuly 2018
Greedy and Local Ratio Algorithms in the MapReduce Model
SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and ArchitecturesPages 43–52https://doi.org/10.1145/3210377.3210386MapReduce has become the de facto standard model for designing distributed algorithms to process big data on a cluster. There has been considerable research on designing efficient MapReduce algorithms for clustering, graph optimization, and submodular ...
- research-articleJune 2018
Frugal Auction Design for Set Systems: Vertex Cover and Knapsack
EC '18: Proceedings of the 2018 ACM Conference on Economics and ComputationPages 645–662https://doi.org/10.1145/3219166.3219229We study mechanism design for procurement auctions in which the goal is to buy a subset of items or hire a team of providers. In order to measure the efficiency of a mechanism, one defines an appropriate benchmark which denotes a reasonable expectation ...
- research-articleMay 2018
Accelerating vertex cover optimization on a GPU architecture
CCGrid '18: Proceedings of the 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid ComputingPages 616–625https://doi.org/10.1109/CCGRID.2018.00008Graphics Processing Units (GPUs) are gaining notable popularity due to their affordable high performance multi-core architecture. They are particularly useful for massive computations that involve large data sets. In this paper, we present a highly ...