{"id":"https://openalex.org/W2475181244","doi":"https://doi.org/10.1145/2942358.2942364","title":"Charge me if you can","display_name":"Charge me if you can","publication_year":2016,"publication_date":"2016-07-05","ids":{"openalex":"https://openalex.org/W2475181244","doi":"https://doi.org/10.1145/2942358.2942364","mag":"2475181244"},"language":"en","primary_location":{"id":"doi:10.1145/2942358.2942364","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2942358.2942364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-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":"https://openalex.org/A5069716714","display_name":"Lin Chen","orcid":"https://orcid.org/0000-0001-7943-3172"},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Lin Chen","raw_affiliation_strings":["LRI-CNRS UMR, Univ. Paris-Sud"],"affiliations":[{"raw_affiliation_string":"LRI-CNRS UMR, Univ. Paris-Sud","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003166096","display_name":"Shan Lin","orcid":"https://orcid.org/0000-0001-6362-2972"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shan Lin","raw_affiliation_strings":["Stony Brook Univ"],"affiliations":[{"raw_affiliation_string":"Stony Brook Univ","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029774958","display_name":"Hua Huang","orcid":"https://orcid.org/0000-0002-2817-2950"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hua Huang","raw_affiliation_strings":["Stony Brook Univ"],"affiliations":[{"raw_affiliation_string":"Stony Brook Univ","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069716714"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I4210144804"],"apc_list":null,"apc_paid":null,"fwci":3.1693,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.92202344,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"110"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.9990000128746033,"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/T12079","display_name":"IoT Networks and Protocols","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6313377618789673},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5815191864967346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5696392059326172},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5172820091247559},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49335232377052307},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4917071461677551},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4431762993335724},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.43954622745513916},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4370110332965851},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2854346036911011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1972293257713318},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19623786211013794},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.13467073440551758},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12905070185661316},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07575914263725281}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6313377618789673},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5815191864967346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5696392059326172},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5172820091247559},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49335232377052307},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4917071461677551},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4431762993335724},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.43954622745513916},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4370110332965851},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2854346036911011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1972293257713318},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19623786211013794},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.13467073440551758},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12905070185661316},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07575914263725281},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2942358.2942364","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2942358.2942364","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01418461v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01418461","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MobiHoc, Jul 2016, Paderborn, Germany. pp.101-110, ⟨10.1145/2942358.2942364⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W626292722","https://openalex.org/W1130343902","https://openalex.org/W1521533637","https://openalex.org/W1562240615","https://openalex.org/W1652389810","https://openalex.org/W1929748128","https://openalex.org/W1968594877","https://openalex.org/W1972755385","https://openalex.org/W1997547017","https://openalex.org/W1998848400","https://openalex.org/W2002048403","https://openalex.org/W2014979132","https://openalex.org/W2022739345","https://openalex.org/W2051747891","https://openalex.org/W2067148637","https://openalex.org/W2072592433","https://openalex.org/W2072954440","https://openalex.org/W2083671491","https://openalex.org/W2089066744","https://openalex.org/W2090486865","https://openalex.org/W2090591027","https://openalex.org/W2092474425","https://openalex.org/W2096140745","https://openalex.org/W2107570439","https://openalex.org/W2108559600","https://openalex.org/W2113939799","https://openalex.org/W2116485803","https://openalex.org/W2144164267","https://openalex.org/W2148026779","https://openalex.org/W2151239055","https://openalex.org/W2158591664","https://openalex.org/W2164674071","https://openalex.org/W2250148975","https://openalex.org/W2290888990","https://openalex.org/W2622090745","https://openalex.org/W6635893188"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2998357381","https://openalex.org/W2101020326","https://openalex.org/W2970302286","https://openalex.org/W2810352541"],"abstract_inverted_index":{"We":[0,45,67],"study":[1],"a":[2,63,86,110],"class":[3],"of":[4,59,81,112],"generic":[5],"optimization":[6,115],"problems":[7,16,118],"on":[8,51],"charger":[9],"scheduling":[10,117],"and":[11,36,42,106,116,126],"charging":[12,54,97,113],"path":[13,55,114],"planing.":[14],"These":[15],"arise":[17],"from":[18],"emerging":[19],"networking":[20],"applications":[21],"where":[22],"mobile":[23,31],"chargers":[24],"are":[25],"dispatched":[26],"to":[27,30,94,108],"deliver":[28],"energy":[29,127],"agents":[32],"(e.g.,":[33],"robots,":[34],"drones,":[35],"vehicles),":[37],"which":[38],"have":[39],"specified":[40],"tasks":[41],"mobility":[43],"patterns.":[44],"instantiate":[46],"our":[47],"work":[48],"by":[49],"focusing":[50],"finding":[52],"the":[53,57,77,95],"maximizing":[56],"number":[58],"nodes":[60],"charged":[61],"within":[62],"fixed":[64],"time":[65,88,125],"horizon.":[66],"prove":[68],"that":[69,90],"this":[70],"problem":[71,78],"is":[72],"APX-hard.":[73],"By":[74],"recursively":[75],"decomposing":[76],"into":[79],"sub-problems":[80],"searching":[82],"sub-paths,":[83],"we":[84],"design":[85],"quasi-polynomial":[87],"algorithm":[89,101],"achieves":[91],"poly-logarithmic":[92],"approximation":[93,100],"optimum":[96],"path.":[98],"Our":[99],"can":[102],"be":[103],"further":[104],"adapted":[105],"extended":[107],"solve":[109],"variety":[111],"with":[119],"realistic":[120],"constraints,":[121],"such":[122],"as":[123],"limited":[124],"budget.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}