An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization
Dependent rounding is a useful technique for optimization problems with hard budget
constraints. This framework naturally leads to negative correlation properties. However, what …
constraints. This framework naturally leads to negative correlation properties. However, what …
A metaheuristic algorithm for vertex cover based link monitoring and backbone formation in wireless ad hoc networks
ZA Dagdeviren - Expert Systems with Applications, 2023 - Elsevier
Wireless ad hoc networks (WANETs) are infrastructureless networks and are used in various
applications such as habitat monitoring, military surveillance, and disaster relief. Data …
applications such as habitat monitoring, military surveillance, and disaster relief. Data …
Weighted connected vertex cover based energy-efficient link monitoring for wireless sensor networks towards secure internet of things
ZA Dagdeviren - IEEE Access, 2021 - ieeexplore.ieee.org
Industry 4.0 utilizes the Internet of Things (IoT) to rise the efficiency in manufacturing and
automation where wireless sensor networks (WSNs) are crucial technologies for …
automation where wireless sensor networks (WSNs) are crucial technologies for …
A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties
In this paper, we consider the k-prize-collecting minimum vertex cover problem with
submodular penalties, which generalizes the well-known minimum vertex cover problem …
submodular penalties, which generalizes the well-known minimum vertex cover problem …
A local-ratio-based power control approach for capacitated access points in mobile edge computing
Q Zhang, W Li, Q Su, X Zhang - … of the 6th International Conference on …, 2022 - dl.acm.org
Terminal devices (TDs) connect to networks through access points (APs) integrated into the
edge server. This provides a prerequisite for TDs to upload tasks to cloud data centers or …
edge server. This provides a prerequisite for TDs to upload tasks to cloud data centers or …
FPT approximation using treewidth: Capacitated vertex cover, target set selection and vector dominating set
H Chu, B Lin - arxiv preprint arxiv:2312.11944, 2023 - arxiv.org
Treewidth is a useful tool in designing graph algorithms. Although many NP-hard graph
problems can be solved in linear time when the input graphs have small treewidth, there are …
problems can be solved in linear time when the input graphs have small treewidth, there are …
Iterative partial rounding for vertex cover with hard capacities
MJ Kao - Proceedings of the Twenty-Eighth Annual ACM-SIAM …, 2017 - SIAM
We provide a simple and novel algorithmic design technique, for which we call iterative
partial rounding, that gives a tight rounding-based approximation for vertex cover with hard …
partial rounding, that gives a tight rounding-based approximation for vertex cover with hard …
Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities
In the CAPACITATED d-HlTTING Set problem input is a universe U equipped with a capacity
function cap: U→ ℕ, and a collection A of subsets of U, each of size at most d. The task is to …
function cap: U→ ℕ, and a collection A of subsets of U, each of size at most d. The task is to …
Tight algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
SC Wong - Proceedings of the Twenty-Eighth Annual ACM-SIAM …, 2017 - SIAM
In this paper we give af-approximation algorithm for the minimum unweighted Vertex Cover
problem with Hard Capacity constraints (VCHC) on f-hypergraphs. This problem generalizes …
problem with Hard Capacity constraints (VCHC) on f-hypergraphs. This problem generalizes …
Improved LP-based approximation algorithms for facility location with hard capacities
MJ Kao - arxiv preprint arxiv:2102.06613, 2021 - arxiv.org
The Capacitated Facility Location (CFL), a long-standing classic problem with intriguing
approximability and literature dated back to the 90s, is considered. Following the open …
approximability and literature dated back to the 90s, is considered. Following the open …