{"id":"https://openalex.org/W2068584825","doi":"https://doi.org/10.1007/s101079900102","title":"A new bound for the ratio between the 2-matching problem and its linear programming relaxation","display_name":"A new bound for the ratio between the 2-matching problem and its linear programming relaxation","publication_year":1999,"publication_date":"1999-12-01","ids":{"openalex":"https://openalex.org/W2068584825","doi":"https://doi.org/10.1007/s101079900102","mag":"2068584825"},"language":"en","primary_location":{"id":"doi:10.1007/s101079900102","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101079900102","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5025268829","display_name":"Sylvia Boyd","orcid":"https://orcid.org/0000-0001-7884-0219"},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sylvia Boyd","raw_affiliation_strings":["Department of Computer Science, University of Ottawa, Ottawa, Canada\u00b6  e-mail: sylvia@site.uottawa.ca, , , , , , CA","Department of Computer Science, University of Ottawa, Ottawa, Canada\u00b6 e-mail: sylvia@site.uottawa.ca, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Ottawa, Ottawa, Canada\u00b6  e-mail: sylvia@site.uottawa.ca, , , , , , CA","institution_ids":["https://openalex.org/I153718931"]},{"raw_affiliation_string":"Department of Computer Science, University of Ottawa, Ottawa, Canada\u00b6 e-mail: sylvia@site.uottawa.ca, CA","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079335021","display_name":"Robert D. Carr","orcid":"https://orcid.org/0009-0001-1085-3926"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]},{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Carr","raw_affiliation_strings":["Sandia National Labs, Albuquerque, New Mexico, USA, e-mail: bobcarr@cs.sandia.gov, , , , , , US","Sandia National Labs, Albuquerque, New Mexico, USA, e-mail: bobcarr@cs.sandia.gov, , US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sandia National Labs, Albuquerque, New Mexico, USA, e-mail: bobcarr@cs.sandia.gov, , , , , , US","institution_ids":["https://openalex.org/I192454743","https://openalex.org/I4210104735"]},{"raw_affiliation_string":"Sandia National Labs, Albuquerque, New Mexico, USA, e-mail: bobcarr@cs.sandia.gov, , US","institution_ids":["https://openalex.org/I192454743"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.8082,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.80247365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"86","issue":"3","first_page":"499","last_page":"514"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"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/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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8245038986206055},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6912832856178284},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6765589714050293},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6454433798789978},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.616287887096405},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6093713641166687},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.606697142124176},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5073243975639343},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4657156467437744},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.465257465839386},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.42267847061157227},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.41348016262054443},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08769926428794861},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06637859344482422}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8245038986206055},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6912832856178284},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6765589714050293},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6454433798789978},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.616287887096405},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6093713641166687},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.606697142124176},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5073243975639343},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4657156467437744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.465257465839386},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.42267847061157227},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.41348016262054443},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08769926428794861},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06637859344482422},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s101079900102","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101079900102","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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":10,"referenced_works":["https://openalex.org/W307896644","https://openalex.org/W1484040084","https://openalex.org/W1604832336","https://openalex.org/W1714357736","https://openalex.org/W2021659530","https://openalex.org/W2027868217","https://openalex.org/W2032495288","https://openalex.org/W2063836932","https://openalex.org/W2327315803","https://openalex.org/W2912533262"],"related_works":["https://openalex.org/W2184834902","https://openalex.org/W2183097989","https://openalex.org/W2241463327","https://openalex.org/W2038458261","https://openalex.org/W2055782437","https://openalex.org/W1579502333","https://openalex.org/W2107689258","https://openalex.org/W2044119054","https://openalex.org/W2038858023","https://openalex.org/W4205854323"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}