{"id":"https://openalex.org/W2145358871","doi":"https://doi.org/10.1007/978-3-642-33090-2_33","title":"A Dual-Fitting $\\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems","display_name":"A Dual-Fitting $\\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2145358871","doi":"https://doi.org/10.1007/978-3-642-33090-2_33","mag":"2145358871"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-33090-2_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-33090-2_33","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101493034","display_name":"James M. Davis","orcid":"https://orcid.org/0000-0002-7196-5649"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James M. Davis","raw_affiliation_strings":["School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, 14853, USA"],"affiliations":[{"raw_affiliation_string":"School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, 14853, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043667154","display_name":"David P. Williamson","orcid":"https://orcid.org/0000-0002-2884-0058"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David P. Williamson","raw_affiliation_strings":["School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, 14853, USA"],"affiliations":[{"raw_affiliation_string":"School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, 14853, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101493034"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3863,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62100193,"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":"373","last_page":"382"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.6807032823562622},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5529053807258606},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5015051364898682},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4260620176792145},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.4147104024887085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33389633893966675},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26113492250442505},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2058890163898468},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12494364380836487},{"id":"https://openalex.org/keywords/art","display_name":"Art","score":0.04800736904144287}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6807032823562622},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5529053807258606},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5015051364898682},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4260620176792145},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.4147104024887085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33389633893966675},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26113492250442505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2058890163898468},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12494364380836487},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.04800736904144287},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-33090-2_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-33090-2_33","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1481791611","https://openalex.org/W1544515183","https://openalex.org/W1965680834","https://openalex.org/W1990313671","https://openalex.org/W1997374695","https://openalex.org/W1997501542","https://openalex.org/W2001139415","https://openalex.org/W2039500680","https://openalex.org/W2047085423","https://openalex.org/W2074402410","https://openalex.org/W2104253179","https://openalex.org/W2483265813"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W1522006748","https://openalex.org/W4212786251","https://openalex.org/W2516172929","https://openalex.org/W2057144288","https://openalex.org/W2963937989"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}