{"id":"https://openalex.org/W4252035792","doi":"https://doi.org/10.1016/s0196-6774(03)00093-2","title":"An approximation algorithm for finding long paths in Hamiltonian graphs","display_name":"An approximation algorithm for finding long paths in Hamiltonian graphs","publication_year":2003,"publication_date":"2003-09-03","ids":{"openalex":"https://openalex.org/W4252035792","doi":"https://doi.org/10.1016/s0196-6774(03)00093-2"},"language":"en","primary_location":{"id":"doi:10.1016/s0196-6774(03)00093-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0196-6774(03)00093-2","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5053966865","display_name":"Sundar Vishwanathan","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sundar Vishwanathan","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT, Mumbai 400076, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT, Mumbai 400076, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053966865"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.42827305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"50","issue":"2","first_page":"246","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965000152587891,"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/algorithm","display_name":"Algorithm","score":0.5831889510154724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48115336894989014},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4744606614112854},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.47360944747924805},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44513779878616333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37619489431381226},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3217448592185974},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.16701066493988037}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5831889510154724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48115336894989014},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4744606614112854},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.47360944747924805},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44513779878616333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37619489431381226},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3217448592185974},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16701066493988037}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0196-6774(03)00093-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0196-6774(03)00093-2","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:dsapce.library.iitb.ac.in:100/1232","is_oa":false,"landing_page_url":"http://doi.org/10.1016/S0196-6774(03)00093-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"11th Annual ACM/SIAM Symposium on Discrete Algorithms,SAN FRANCISCO, CALIFORNIA,JAN 09-11, 2000","raw_type":"Article; Proceedings Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1586904125","https://openalex.org/W1655990431","https://openalex.org/W1976157781","https://openalex.org/W2046496468","https://openalex.org/W2066700938","https://openalex.org/W2091252880","https://openalex.org/W2296148711","https://openalex.org/W6635196688"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2544423928","https://openalex.org/W2052122378","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2980963558","https://openalex.org/W2181413294","https://openalex.org/W2989452537"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}