{"id":"https://openalex.org/W7106582097","doi":"https://doi.org/10.1109/ton.2025.3631647","title":"A Constant-Approximation Algorithm for Budgeted Sweep Coverage With Mobile Sensors","display_name":"A Constant-Approximation Algorithm for Budgeted Sweep Coverage With Mobile Sensors","publication_year":2025,"publication_date":"2025-11-24","ids":{"openalex":"https://openalex.org/W7106582097","doi":"https://doi.org/10.1109/ton.2025.3631647"},"language":null,"primary_location":{"id":"doi:10.1109/ton.2025.3631647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3631647","pdf_url":null,"source":{"id":"https://openalex.org/S5407042750","display_name":"IEEE Transactions on Networking","issn_l":"2998-4157","issn":["2998-4157"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Networking","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Wei Liang","orcid":"https://orcid.org/0000-0002-4586-4959"},"institutions":[{"id":"https://openalex.org/I135237710","display_name":"Zhejiang Normal University","ror":"https://ror.org/01vevwk45","country_code":"CN","type":"education","lineage":["https://openalex.org/I135237710"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Liang","raw_affiliation_strings":["School of Computer Science and Technology, Zhejiang Normal University, Jinhua, Zhejiang, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Zhejiang Normal University, Jinhua, Zhejiang, China","institution_ids":["https://openalex.org/I135237710"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Shaojie Tang","orcid":"https://orcid.org/0000-0001-9261-5210"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shaojie Tang","raw_affiliation_strings":["School of Management, University at Buffalo, Buffalo, NY, USA"],"affiliations":[{"raw_affiliation_string":"School of Management, University at Buffalo, Buffalo, NY, USA","institution_ids":["https://openalex.org/I63190737"]}]},{"author_position":"last","author":{"id":null,"display_name":"Zhao Zhang","orcid":"https://orcid.org/0000-0003-4191-7598"},"institutions":[{"id":"https://openalex.org/I135237710","display_name":"Zhejiang Normal University","ror":"https://ror.org/01vevwk45","country_code":"CN","type":"education","lineage":["https://openalex.org/I135237710"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhao Zhang","raw_affiliation_strings":["School of Mathematical Sciences, Zhejiang Normal University, Jinhua, Zhejiang, China"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Zhejiang Normal University, Jinhua, Zhejiang, China","institution_ids":["https://openalex.org/I135237710"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135237710"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.62412129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":null,"first_page":"1777","last_page":"1788"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.574400007724762,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.574400007724762,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.10840000212192535,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.037700001150369644,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5651999711990356},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5446000099182129},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48420000076293945},{"id":"https://openalex.org/keywords/mobile-device","display_name":"Mobile device","score":0.3953000009059906},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.3553999960422516},{"id":"https://openalex.org/keywords/point-of-interest","display_name":"Point of interest","score":0.31859999895095825}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6693000197410583},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5651999711990356},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5446000099182129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.531499981880188},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.505299985408783},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48420000076293945},{"id":"https://openalex.org/C186967261","wikidata":"https://www.wikidata.org/wiki/Q5082128","display_name":"Mobile device","level":2,"score":0.3953000009059906},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3553999960422516},{"id":"https://openalex.org/C150140777","wikidata":"https://www.wikidata.org/wiki/Q960648","display_name":"Point of interest","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C95491727","wikidata":"https://www.wikidata.org/wiki/Q992968","display_name":"Mobile telephony","level":3,"score":0.31529998779296875},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C144543869","wikidata":"https://www.wikidata.org/wiki/Q2738570","display_name":"Mobile computing","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2662000060081482},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.26429998874664307}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ton.2025.3631647","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ton.2025.3631647","pdf_url":null,"source":{"id":"https://openalex.org/S5407042750","display_name":"IEEE Transactions on Networking","issn_l":"2998-4157","issn":["2998-4157"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W1596429033","https://openalex.org/W1857333123","https://openalex.org/W1969481197","https://openalex.org/W1974713906","https://openalex.org/W1994724899","https://openalex.org/W1998327496","https://openalex.org/W1999117624","https://openalex.org/W2018607199","https://openalex.org/W2033937250","https://openalex.org/W2050819731","https://openalex.org/W2056897184","https://openalex.org/W2068752469","https://openalex.org/W2071701840","https://openalex.org/W2077326088","https://openalex.org/W2082628447","https://openalex.org/W2085304782","https://openalex.org/W2088761355","https://openalex.org/W2088863909","https://openalex.org/W2107651971","https://openalex.org/W2113873983","https://openalex.org/W2113939799","https://openalex.org/W2115556222","https://openalex.org/W2128940723","https://openalex.org/W2145866065","https://openalex.org/W2148309545","https://openalex.org/W2158591664","https://openalex.org/W2168970473","https://openalex.org/W2331279671","https://openalex.org/W2346699423","https://openalex.org/W2622090745","https://openalex.org/W2795378725","https://openalex.org/W2884985914","https://openalex.org/W2888568929","https://openalex.org/W2890401796","https://openalex.org/W2948333404","https://openalex.org/W2990474946","https://openalex.org/W3041176344","https://openalex.org/W3092217301","https://openalex.org/W3098529913","https://openalex.org/W3111623254","https://openalex.org/W3114913938","https://openalex.org/W3129736740","https://openalex.org/W3131448387","https://openalex.org/W3141952533","https://openalex.org/W3161996405","https://openalex.org/W3174352199","https://openalex.org/W3176143293","https://openalex.org/W3184002573","https://openalex.org/W4205799442","https://openalex.org/W4220901620","https://openalex.org/W4250809433","https://openalex.org/W4281480108","https://openalex.org/W4283367767","https://openalex.org/W4313034740","https://openalex.org/W4377224546","https://openalex.org/W4379932028","https://openalex.org/W4380303831","https://openalex.org/W4385075968","https://openalex.org/W4386088201","https://openalex.org/W4392405807","https://openalex.org/W4413680221"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,45],"paper,":[2],"we":[3,47],"present":[4],"the":[5,52],"first":[6,50],"constant-approximation":[7,96,106],"algorithm":[8,97],"for":[9,22,98,107,114],"<italic":[10,53],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[11,54,67,88],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">budgeted":[12],"sweep":[13],"coverage":[14],"problem</i>":[15,56],"(BSC).":[16],"The":[17,58],"BSC":[18],"involves":[19],"designing":[20],"routes":[21],"a":[23,63,84,95,105],"number":[24],"of":[25,40,65],"mobile":[26,116],"sensors":[27],"(a.k.a.":[28],"robots)":[29],"to":[30,49,61,83,103],"periodically":[31],"collect":[32],"information":[33],"as":[34,36,76,79],"much":[35],"possible":[37,80],"from":[38],"points":[39],"interest":[41],"(PoIs).":[42],"To":[43],"approach":[44],"problem,":[46],"propose":[48],"examine":[51],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">multi-orienteering":[55],"(MOP).":[57],"MOP":[59,99],"aims":[60],"find":[62],"set":[64],"<inline-formula":[66,87],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[68,89],"<tex-math":[69,90],"notation=\"LaTeX\">$m$</tex-math>":[70],"</inline-formula>":[71],"vertex-disjoint":[72],"paths":[73],"that":[74],"cover":[75],"many":[77],"vertices":[78],"while":[81],"adhering":[82],"budget":[85],"constraint":[86],"notation=\"LaTeX\">$B$</tex-math>":[91],"</inline-formula>.":[92],"We":[93],"develop":[94],"and":[100,119],"utilize":[101],"it":[102],"achieve":[104],"BSC.":[108],"Our":[109],"findings":[110],"open":[111],"new":[112],"possibilities":[113],"optimizing":[115],"sensor":[117],"deployments":[118],"related":[120],"combinatorial":[121],"optimization":[122],"tasks.":[123]},"counts_by_year":[],"updated_date":"2026-01-10T23:39:48.068659","created_date":"2025-11-25T00:00:00"}