{"id":"https://openalex.org/W2571694026","doi":"https://doi.org/10.1090/dimacs/049/07","title":"Finding minimum weighted generators of a path system","display_name":"Finding minimum weighted generators of a path system","publication_year":1999,"publication_date":"1999-05-18","ids":{"openalex":"https://openalex.org/W2571694026","doi":"https://doi.org/10.1090/dimacs/049/07","mag":"2571694026"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/049/07","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/049/07","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5091492325","display_name":"Andr\u00e1s Frank","orcid":"https://orcid.org/0000-0001-6161-4848"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andr\u00e1s Frank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5091492325"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8525,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.73800259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9907000064849854,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9907000064849854,"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/T13935","display_name":"Mathematical Control Systems and Analysis","score":0.9478999972343445,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9434000253677368,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/path","display_name":"Path (computing)","score":0.5252673029899597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41272708773612976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3416237235069275},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07228285074234009}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5252673029899597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41272708773612976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3416237235069275},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07228285074234009}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/049/07","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/049/07","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.89","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.89","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.elte.hu/~frank/pub/DIMACS.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2371125232","https://openalex.org/W2023505575","https://openalex.org/W2373437113","https://openalex.org/W2125453582","https://openalex.org/W2317449002","https://openalex.org/W3106476875","https://openalex.org/W2384974102","https://openalex.org/W1987863679","https://openalex.org/W2316925676","https://openalex.org/W2784047283"],"abstract_inverted_index":{"In":[0,95],"a":[1,8,13,24,50,98,107,146],"recent":[2],"paper":[3,97],"the":[4,44,77,85,92,166],"author":[5],"[1997a]":[6],"described":[7,102],"short":[9],"algorithmic":[10],"proof":[11,70,100],"of":[12,16,23,26,28],"min-max":[14],"theorem":[15,40],"E.":[17],"Gyori":[18],"[1984]":[19],"on":[20,91],"minimum":[21,59],"generators":[22,52,61],"system":[25],"subpaths":[27],"an":[29],"underlying":[30,45],"path.":[31],"A.":[32],"Frank":[33],"and":[34,58,76,160,165,191],"T.":[35],"Jord'an":[36],"[1995]":[37],"generalized":[38],"Gyori's":[39],"in":[41,88],"several":[42],"ways;":[43],"path":[46],"was":[47,73],"replaced":[48],"by":[49],"circuit,":[51,148],"were":[53,62],"extended":[54],"to":[55,83,106],"weighted":[56],"generators,":[57],"cost":[60],"also":[63],"treated":[64],"for":[65],"node-induced":[66],"cost-functions.":[67],"The":[68],"original":[69],"method":[71],"however":[72],"not":[74],"constructive":[75,99],"only":[78],"known":[79],"algorithm":[80],"so":[81],"far":[82],"solve":[84],"optimization":[86],"problems":[87],"question":[89],"relied":[90],"ellipsoid":[93],"method.":[94],"this":[96],"is":[101],"which":[103],"gives":[104],"rise":[105],"purely":[108],"combinatorial":[109],"strongly":[110],"polynomial":[111],"algorithm.":[112],"1.":[113],"INTRODUCTION":[114],"Let":[115,179],"P":[116],"=":[117,141],"(v":[118],"0":[119,143,183],";":[120,123,126,129,132,136,139,170,174,184,188,196,200],"j":[121,127,137,154,201],"1":[122,125,169,195],"v":[124,130,142,158,162,168,175,189],"2":[128,131],":":[133,134,135,171,172,173,185,186,187,197,198,199],"n":[138,176],"vn":[140],")":[144],"be":[145],"directed":[147,152],"that":[149],"is,":[150],"each":[151],"edge":[153],"i":[155,163],"has":[156],"tail":[157],"i\\\\Gamma1":[159],"head":[161],",":[164],"nodes":[167],"are":[177],"distinct.":[178],"V":[180],":=":[181,193],"fv":[182],"ng":[190,202],"E":[192],"fj":[194],"...":[203]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}