Results 281 to 290 of about 4,819,979 (323)
Some of the next articles are maybe not open access.
On Colorful Vertex and Edge Cover Problems
Algorithmica, 2023In this paper, we study two generalizations of Vertex Cover and Edge Cover , namely Colorful Vertex Cover and Colorful Edge Cover . In the Colorful Vertex Cover problem, given an n -vertex edge-colored graph G with colors from $$\{1, \ldots , \omega \}$$
Sayan Bandyapadhyay +2 more
semanticscholar +1 more source
Approximate Core Allocations for Edge Cover Games
IJTCS-FAW, 2023We study the approximate core for edge cover games, which are cooperative games stemming from edge cover problems. In these games, each player controls a vertex on a network $G = (V, E; w)$, and the cost of a coalition $S\subseteq V$ is equivalent to the
Tianhan Lu, Han Xiao, Qizhi Fang
semanticscholar +1 more source
Adaptive Anonymization of Data using b-Edge Cover
International Conference for High Performance Computing, Networking, Storage and Analysis, 2018We explore the problem of sharing data that pertains to individuals with anonymity guarantees, where each user requires a desired level of privacy. We propose the first shared- memory as well as distributed memory parallel algorithms for the adaptive ...
Arif M. Khan +5 more
semanticscholar +1 more source
Approximating activation edge-cover and facility location problems
International Symposium on Mathematical Foundations of Computer Science, 2018What approximation ratio can we achieve for the Facility Location problem if whenever a client $u$ connects to a facility $v$,the opening cost of $v$ is at most $\theta$ times the service cost of $u$?
Zeev Nutov, Eli Shalom
semanticscholar +1 more source
Edge Computing-Based Intelligent Manhole Cover Management System for Smart Cities
IEEE Internet of Things Journal, 2018An intelligent manhole cover management system (IMCS) is one of the most important basic platforms in a smart city to prevent frequent manhole cover accidents.
Gangyong Jia +3 more
semanticscholar +1 more source
Approximating vertex cover using edge-based representations
FOGA XII '13, 2013In the literature only lower bounds are available on the approximation ratio of randomised search heuristics for vertex cover in the single-objective problem setting. These analyses are based on the natural vertex-based representation. Inspired by a well-
T. Jansen, P. S. Oliveto, C. Zarges
semanticscholar +1 more source
Parallel Algorithms Through Approximation: B-Edge Cover
IEEE International Parallel and Distributed Processing Symposium, 2018S. Ferdous, Arif M. Khan, A. Pothen
semanticscholar +1 more source
Edge-based cover recognition and tracking method for an AR-aided aircraft inspection system
The International Journal of Advanced Manufacturing Technology, 2020Xu Yang +4 more
semanticscholar +1 more source
A New 3/2-Approximation Algorithm for the b-Edge Cover Problem
International Conference on Scientific Computing, 2016Arif M. Khan, A. Pothen
semanticscholar +1 more source