Evidence map›Paper›PMID 36597504›Full record

ArticleOptimization letters2022

On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms.

Yongge Yang, Po-An Chen, Yu-Ching Lee, Yung-Yan Fanchiang

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Optimization letters, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Yongge YangDepartment of Industrial Engineering and Engineering Management, National Tsing Hua University, 101, Section 2, Kuang-Fu Road, Hsinchu City, 300044 Taiwan.
Po-An ChenInstitute of Information Management, National Yang Ming Chiao Tung University, 1001 University Road, Hsinchu City, 300010 Taiwan.
Yu-Ching LeeDepartment of Industrial Engineering and Engineering Management, National Tsing Hua University, 101, Section 2, Kuang-Fu Road, Hsinchu City, 300044 Taiwan.
Yung-Yan FanchiangInstitute of Information Management, National Yang Ming Chiao Tung University, 1001 University Road, Hsinchu City, 300010 Taiwan.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

When an infectious disease spreads, how to quickly vaccinate with a limited budget per time step to reduce the impact of the virus is very important. Specifically, vaccination will be carried out in every time step, and vaccinated nodes will no longer be infected. Meanwhile, the protection from vaccination can spread to the neighbors of a vaccinated node. Our goal is to efficiently find optimal and approximation solutions to our problem with various algorithms. In this paper, we first design an integer linear program to solve this problem. We then propose approximation algorithms of (1) Linear programming (LP) deterministic threshold rounding, (2) LP dependent randomized rounding, and (3) LP independent randomized rounding. We prove that the LP independent randomized rounding algorithm has a high probability of finding a feasible solution that gives an approximation ratio of

Indexed as

Firefighter problem with vaccination spreadingInteger programRandomized roundingVaccination strategy

Identifiers

PMID36597504
PMCPMC9801162

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.