arbiter
JournalsPricingAccount

Approximation algorithm for the Min-Max partial tree cover problem

Lei Zhao & Zhao Zhang

Mathematical Methods of Operations Research2026https://doi.org/10.1007/s00186-026-00921-xarticle
AJG 1
Weight
0.50

What the paper says

No abstract available.

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1007/s00186-026-00921-x

Or copy a formatted citation

@article{lei2026,
  title        = {{Approximation algorithm for the Min-Max partial tree cover problem}},
  author       = {Lei Zhao & Zhao Zhang},
  journal      = {Mathematical Methods of Operations Research},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1007/s00186-026-00921-x},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

Approximation algorithm for the Min-Max partial tree cover problem

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.50

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.50 × 0.4 = 0.20
M · momentum0.50 × 0.15 = 0.07
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.