{"id":"https://openalex.org/W1969180675","doi":"https://doi.org/10.1137/s0895480197331454","title":"A 3/2-Approximation Algorithm for the Mixed Postman Problem","display_name":"A 3/2-Approximation Algorithm for the Mixed Postman Problem","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1969180675","doi":"https://doi.org/10.1137/s0895480197331454","mag":"1969180675"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480197331454","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480197331454","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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":"https://openalex.org/A5046140110","display_name":"Balaji Raghavachari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Balaji Raghavachari","raw_affiliation_strings":["Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111958010","display_name":"Jeyakesavan Veerasamy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101778","display_name":"Samsung (United States)","ror":"https://ror.org/01bfbvm65","country_code":"US","type":"company","lineage":["https://openalex.org/I2250650973","https://openalex.org/I4210101778"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeyakesavan Veerasamy","raw_affiliation_strings":["Samsung Telecommunications America"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Samsung Telecommunications America","institution_ids":["https://openalex.org/I4210101778"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.188,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.89751765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"4","first_page":"425","last_page":"433"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976000189781189,"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.9976000189781189,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/mixed-graph","display_name":"Mixed graph","score":0.7983719706535339},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7615331411361694},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.7526761293411255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7025643587112427},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5208783149719238},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.5129970908164978},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4936717450618744},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46844130754470825},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4297686815261841},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4241180121898651},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.39410099387168884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3287331461906433},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.2760184407234192}],"concepts":[{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.7983719706535339},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7615331411361694},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.7526761293411255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7025643587112427},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5208783149719238},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.5129970908164978},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4936717450618744},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46844130754470825},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4297686815261841},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4241180121898651},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.39410099387168884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3287331461906433},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2760184407234192},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480197331454","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480197331454","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1968384435","https://openalex.org/W1986637787","https://openalex.org/W2027296491","https://openalex.org/W2036619365","https://openalex.org/W2062403584","https://openalex.org/W2064284095","https://openalex.org/W2092395565","https://openalex.org/W2094043080","https://openalex.org/W2123789618","https://openalex.org/W2126141749","https://openalex.org/W2505968561"],"related_works":["https://openalex.org/W2012366085","https://openalex.org/W3196191381","https://openalex.org/W1544449826","https://openalex.org/W1969180675","https://openalex.org/W4313389576","https://openalex.org/W4300830888","https://openalex.org/W193789760","https://openalex.org/W4322810890","https://openalex.org/W1573376749","https://openalex.org/W2952011859"],"abstract_inverted_index":{"The":[0,38],"mixed":[1,25,62,78],"postman":[2,9,75],"problem,":[3,10],"a":[4,23,68],"generalization":[5],"of":[6,13,22,71],"the":[7,15,47,53,74],"Chinese":[8],"is":[11,40,49,55,59,80],"that":[12,18],"finding":[14],"shortest":[16],"tour":[17],"traverses":[19],"each":[20],"edge":[21],"given":[24],"graph":[26,28,48,54],"(a":[27],"containing":[29],"both":[30],"undirected":[31,50],"and":[32],"directed":[33],"edges)":[34],"at":[35],"least":[36],"once.":[37],"problem":[39,76],"solvable":[41],"in":[42,61],"polynomial":[43],"time":[44],"either":[45],"if":[46,52],"or":[51],"directed,":[56],"but":[57],"it":[58],"NP-hard":[60],"graphs.":[63],"An":[64],"approximation":[65],"algorithm":[66],"with":[67],"performance":[69],"ratio":[70],"3/2":[72],"for":[73],"on":[77],"graphs":[79],"presented.":[81]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}