{"id":"https://openalex.org/W2255866406","doi":"https://doi.org/10.1007/978-3-662-48971-0_17","title":"Minimizing the Maximum Moving Cost of Interval Coverage","display_name":"Minimizing the Maximum Moving Cost of Interval Coverage","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2255866406","doi":"https://doi.org/10.1007/978-3-662-48971-0_17","mag":"2255866406"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-48971-0_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-48971-0_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/2031/56290298-ec4c-42aa-92c5-a29efc1e0f25","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100457237","display_name":"Haitao Wang","orcid":"https://orcid.org/0000-0003-1312-6414"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haitao Wang","raw_affiliation_strings":["Department of Computer Science, Utah State University, Logan, UT, 84322, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, UT, 84322, USA","institution_ids":["https://openalex.org/I121980950"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100696673","display_name":"Xiao Zhang","orcid":"https://orcid.org/0000-0002-8020-6142"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xiao Zhang","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon Tong, Hong Kong","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100457237"],"corresponding_institution_ids":["https://openalex.org/I121980950"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.5159,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.97113752,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"188","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10986","display_name":"RFID technology advancements","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/interval","display_name":"Interval (graph theory)","score":0.8713310956954956},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5849950909614563},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5548645853996277},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5202387571334839},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43967732787132263},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39804306626319885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3972301185131073},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08613705635070801}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.8713310956954956},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5849950909614563},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5548645853996277},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5202387571334839},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43967732787132263},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39804306626319885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3972301185131073},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08613705635070801}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-48971-0_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-48971-0_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/56290298-ec4c-42aa-92c5-a29efc1e0f25","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/56290298-ec4c-42aa-92c5-a29efc1e0f25","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wang, H & Zhang , X 2015, 'Minimizing the Maximum Moving Cost of Interval Coverage', Paper presented at The 26th International Symposium on Algorithms and Computation, Japan, 9/12/15 - 11/12/15.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/56290298-ec4c-42aa-92c5-a29efc1e0f25","is_oa":true,"landing_page_url":"https://hdl.handle.net/2031/56290298-ec4c-42aa-92c5-a29efc1e0f25","pdf_url":null,"source":{"id":"https://openalex.org/S7407055387","display_name":"CityU Scholars","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Wang, H & Zhang , X 2015, 'Minimizing the Maximum Moving Cost of Interval Coverage', Paper presented at The 26th International Symposium on Algorithms and Computation, Japan, 9/12/15 - 11/12/15.","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W64781136","https://openalex.org/W1530465016","https://openalex.org/W1755547434","https://openalex.org/W1988777116","https://openalex.org/W1993949040","https://openalex.org/W1998781240","https://openalex.org/W2088863909","https://openalex.org/W2097004206","https://openalex.org/W2125242971","https://openalex.org/W2518112409","https://openalex.org/W2999848917","https://openalex.org/W3145128584","https://openalex.org/W4246219036","https://openalex.org/W4251391716"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2356676145","https://openalex.org/W2358939236","https://openalex.org/W2239330273","https://openalex.org/W2093858167","https://openalex.org/W2371953206","https://openalex.org/W2349543044","https://openalex.org/W2365728856","https://openalex.org/W2350406672","https://openalex.org/W1997511791"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}