{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T20:09:04Z","timestamp":1778357344997,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:00:00Z","timestamp":1775692800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005230","name":"Chongqing Natural Science Foundation","doi-asserted-by":"publisher","award":["CSTB2022NSCQ-LZX0003"],"award-info":[{"award-number":["CSTB2022NSCQ-LZX0003"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["12571342"],"award-info":[{"award-number":["12571342"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["62372394"],"award-info":[{"award-number":["62372394"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115958","type":"journal-article","created":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T08:11:48Z","timestamp":1775808708000},"page":"115958","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Partial interval multicover: Approximation and complexity"],"prefix":"10.1016","volume":"1075","author":[{"given":"Peng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangzhi","family":"Tu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6927-438X","authenticated-orcid":false,"given":"Yixin","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115958_bib0001","series-title":"Approximation Algorithms","author":"Vazirani","year":"2003"},{"issue":"5","key":"10.1016\/j.tcs.2026.115958_bib0002","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0190(97)00182-8","article-title":"Improved performance of the greedy algorithm for partial cover","volume":"64","author":"Slav\u00edk","year":"1997","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10.1016\/j.tcs.2026.115958_bib0003","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0097539793260763","article-title":"Primal-dual RNC approximation algorithms for set cover and covering integer programs","volume":"28","author":"Rajagopalan","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115958_bib0004","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s10898-021-01033-y","article-title":"Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks","volume":"80","author":"Ran","year":"2021","journal-title":"J. Global Optim."},{"issue":"3","key":"10.1016\/j.tcs.2026.115958_bib0005","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1002\/net.22263","article-title":"Approximation algorithm for the minimum interval partial multi-cover problem","volume":"85","author":"Ran","year":"2025","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.tcs.2026.115958_bib0006","doi-asserted-by":"crossref","first-page":"574","DOI":"10.14778\/1687627.1687693","article-title":"Sequential dependencies","volume":"2","author":"Golab","year":"2009","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"10.1016\/j.tcs.2026.115958_bib0007","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1007\/s00453-014-9956-7","article-title":"PTAS for densest k-subgraph in interval graphs","volume":"74","author":"Nonner","year":"2016","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.tcs.2026.115958_bib0008","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.jda.2010.09.002","article-title":"Complexity issues in vertex-colored graph pattern matching","volume":"9","author":"Dondi","year":"2011","journal-title":"J. Discrete Algoritms"},{"key":"10.1016\/j.tcs.2026.115958_bib0009","series-title":"Colloque sur la Th\u00e9orie des Nombres, Bruxelles","first-page":"127","article-title":"Problems and results in additive number theory","author":"Erd\u0151s","year":"1955"},{"key":"10.1016\/j.tcs.2026.115958_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2025.115369","article-title":"A 1\/2-approximation algorithm for maximum interval multi-cover","volume":"1049","author":"Xu","year":"2025","journal-title":"Theor. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002173?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002173?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T19:29:24Z","timestamp":1778354964000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":10,"alternative-id":["S0304397526002173"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115958","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Partial interval multicover: Approximation and complexity","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115958","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115958"}}