The Covering Problem by Thomas Place, Marc Zeitoun

“…The main contribution of this paper is a suitable candidate to play this role: the Covering Problem. We motivate this problem with 3 arguments. …”
Get full text

The Lebesgue universal covering problem by John C. Baez, Karine Bagdasaryan, Philip Gibbs

Get full text

Weighted geometric set cover problems revisited by Sariel Har-Peled, Mira Lee

“…We study several set cover problems in low dimensional geometric settings. …”
Get full text

An Exact Algorithm for Minimum Vertex Cover Problem by Luzhi Wang, Shuli Hu, Mingyang Li, Junping Zhou

Get full text

On Streaming and Communication Complexity of the Set Cover Problem by Demaine, Erik D., Indyk, Piotr, Mahabadi, Sepideh, Vakilian, Ali

“…We develop the first streaming algorithm and the first two-party communication protocol that uses a constant number of passes/rounds and sublinear space/communication for logarithmic approximation to the classic Set Cover problem. Specifically, for n elements and m sets, our algorithm/protocol achieves a space bound of O(m ·n [superscript δ] log[superscript 2] n logm) using O(4[superscript 1/δ]) passes/rounds while achieving an approximation factor of O(4[superscript 1/δ]logn) in polynomial time (for δ = Ω(1/logn)). …”
Get full text
Get full text
Get full text
Get full text
Get full text

On the Computational Complexity of Optimization Convex Covering Problems of Graphs by Radu Buzatu

Get full text

The parsimonious property of cut covering problems and its applications by Bertsimas, Dimitris, Teo, Chungpiaw

Get full text

The parsimonious property of cut covering problems and its applications

Get full text

Set Covering Problem in Transport Nets Expanding Models by Dušan TEICHMANN, Markéta HLAVSOVÁ, Erika KONUPČÍKOVÁ

Get full text

Application of genetic algorithm for the set-covering problem solution by Igor S. Konovalov, Vladimir A. Fatkhi, Valery G. Kobak

Subjects: Get full text

A Local Branching Approach for the Set Covering Problem by Masoud Yaghini, Mohsen Momeni, Mohammadreza Momeni Sarmadi

Subjects: Get full text

An Improved Memetic Algorithm for the Partial Vertex Cover Problem by Yupeng Zhou, Changze Qiu, Yiyuan Wang, Mingjie Fan, Minghao Yin

“…As a generalized form of the classical minimum vertex cover problem (MVCP), the minimum partial vertex cover problem not only inherits the value of MVCP in both theoretical and practical research but also extends the application scenarios under the current era of big data. …”
Get full text

Dynamic Hub Covering Problem with Flexible Covering Radius by Yahia Zare Mehrjerdi, Amir Ebrahimi zade, Hassan Hosseininasab

Subjects: Get full text

Approximation of Euclidean k-size cycle cover problem by Michael Khachay, Katherine Neznakhina

“…We call this problem the Minimumweight k-size cycle cover problem (or Min-k-SCCP) due to the fact that the problem has the following mathematical statement. …”
Get full text

Towards Tight Bounds for the Streaming Set Cover Problem by Har-Peled, Sariel, Indyk, Piotr, Mahabadi, Sepideh, Vakilian, Ali

“…We consider the classic Set Cover problem in the data stream model. For n elements and m sets (m ≥ n) we give a O(1/δ)-pass algorithm with a strongly sub-linear ~O(mn[superscript δ]) space and logarithmic approximation factor. …”
Get full text
Get full text
Get full text
Get full text

Competitive algorithms for online matching and vertex cover problems by Wong, Chiu Wai, M. Eng. Massachusetts Institute of Technology

Get full text

On reserve and double covering problems for the sets with non-Euclidean metrics by Lempert Anna, Kazakov Alexander, Le Quang Mung

Subjects: “…covering problem…”
Get full text

Application of ant colony optimization metaheuristic on set covering problems by Christian Alvin Buhat, Jerson Ken Villamin, Genaro Cuaresma

Subjects: Get full text

A Meta-Optimization Approach to Solve the Set Covering Problem by Gino Astorga, Broderick Crawford, Ricardo Soto, Eric Monfroy, José García, Enrique Cortes

Subjects: “…Set Covering Problems…”
Get full text

A quantum annealing approach to solve max-cover problem by NGUYEN Thi Uyen, NGUYEN Canh An, DO Mai Trang, TRAN Xuan Sang

Subjects: Get full text