乐胖代购免代理版

{"id":"https://openalex.org/W2568219823","doi":"https://doi.org/10.1142/s0129054110007623","title":"PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k","display_name":"PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k","publication_year":2010,"publication_date":"2010-11-24","ids":{"openalex":"https://openalex.org/W2568219823","doi":"https://doi.org/10.1142/s0129054110007623","mag":"2568219823"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007623","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://arxiv.org/pdf/0904.2576","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050123676","display_name":"Anna Adamaszek","orcid":"https://orcid.org/0000-0003-3291-0124"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"ANNA ADAMASZEK","raw_affiliation_strings":["Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051815913","display_name":"Artur Czumaj","orcid":"https://orcid.org/0000-0002-7743-438X"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"ARTUR CZUMAJ","raw_affiliation_strings":["Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016509031","display_name":"Andrzej Lingas","orcid":"https://orcid.org/0000-0003-4998-9844"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"ANDRZEJ LINGAS","raw_affiliation_strings":["Department of Computer Science, Lund University, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.517,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":23,"citation_normalized_percentile":{"value":0.919687,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":91},"biblio":{"volume":"21","issue":"06","first_page":"893","last_page":"904"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9996,"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.9996,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9952,"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/T12176","display_name":"Optimization and Packing Problems","score":0.994,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5561192},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5193804},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4533141}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.8483851},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.76166534},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7379435},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.6619596},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.57279813},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5561192},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5279804},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5193804},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49783492},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49645764},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4894146},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.47865498},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46523207},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4533141},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45107833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4214695},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15524936},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14976937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0972963},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054110007623","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://arxiv.org/abs/0904.2576","pdf_url":"http://arxiv.org/pdf/0904.2576","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"http://arxiv.org/abs/0904.2576","pdf_url":"http://arxiv.org/pdf/0904.2576","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":11,"referenced_works":["https://openalex.org/W1208385249","https://openalex.org/W1601649239","https://openalex.org/W1994248285","https://openalex.org/W2011039300","https://openalex.org/W2029681015","https://openalex.org/W2111563176","https://openalex.org/W2155735286","https://openalex.org/W2156760067","https://openalex.org/W2165142526","https://openalex.org/W2911302472","https://openalex.org/W41322358"],"related_works":["https://openalex.org/W4244934433","https://openalex.org/W2970302286","https://openalex.org/W2962917430","https://openalex.org/W2799046353","https://openalex.org/W2783992526","https://openalex.org/W2147086810","https://openalex.org/W2141355868","https://openalex.org/W2072890400","https://openalex.org/W1982537107","https://openalex.org/W1815446007"],"abstract_inverted_index":{"Let":[0],"P":[1],"be":[2,15,74],"a":[3,95,127,133,160,169,175],"set":[4,120,170,177],"of":[5,42,91,103,121,123,139,163,171,178,180],"n":[6,145,172],"points":[7,47,64,173],"in":[8,19,48,57,156],"the":[9,16,20,23,29,34,39,119,157,164,181],"Euclidean":[10],"plane":[11],"and":[12,55,59,93],"let":[13],"O":[14,58],"origin":[17],"point":[18],"plane.":[21],"In":[22,113],"k-tour":[24,68,165],"cover":[25,45,69,166],"problem":[26,70,167],"(called":[27],"frequently":[28],"capacitated":[30],"vehicle":[31],"routing":[32],"problem),":[33],"goal":[35],"is":[36,71,79,129,159],"to":[37,73,82,174],"minimize":[38],"total":[40],"length":[41],"tours":[43],"that":[44,51],"all":[46,89,137],"P,":[49],"such":[50],"each":[52,183],"tour":[53],"starts":[54],"ends":[56],"covers":[60],"at":[61],"most":[62],"k":[63,92,105,124,140],"from":[65],"P.":[66],"The":[67,151],"known":[72,81],"[Formula:":[75],"see":[76],"text]-hard.":[77],"It":[78],"also":[80],"admit":[83],"constant":[84],"factor":[85],"approximation":[86,97],"algorithms":[87],"for":[88,100,125,136],"values":[90,102,122,138],"even":[94],"polynomial-time":[96],"scheme":[98],"(PTAS)":[99],"small":[101,176],"k,":[104],"=":[106,149],"\u00d8(":[107],"log":[108,110,111,143],"n/":[109],"n).":[112],"this":[114],"paper,":[115],"we":[116],"significantly":[117],"enlarge":[118],"which":[126],"PTAS":[128,135],"provable.":[130],"We":[131],"present":[132],"new":[134],"\u2264":[141],"2":[142],"\u03b4":[144,148],",":[146],"where":[147],"\u03b4(\u03b5).":[150],"main":[152],"technical":[153],"result":[154],"proved":[155],"paper":[158],"novel":[161],"reduction":[162],"with":[168,184],"instances":[179],"problem,":[182],"\u00d8((k/\u03b5)":[185],"\u00d8(1)":[186],")":[187],"points.":[188]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2568219823","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2024-12-07T19:20:13.218448","created_date":"2017-01-13"}