{"id":"https://openalex.org/W1566313961","doi":"https://doi.org/10.1007/3-540-45061-0_16","title":"Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem","display_name":"Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1566313961","doi":"https://doi.org/10.1007/3-540-45061-0_16","mag":"1566313961"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45061-0_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45061-0_16","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/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjeev Arora","raw_affiliation_strings":["Princeton University, Princeton","Princeton Univ., Princeton , NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton Univ., Princeton , NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038076555","display_name":"Kevin Chang","orcid":"https://orcid.org/0000-0001-6895-8950"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin L. Chang","raw_affiliation_strings":["Yale University, New Haven","YALE UNIVERSITY, New Haven, CT"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103209777"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0616,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76851276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"176","last_page":"188"},"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.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.8203610777854919},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7844074368476868},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6433542370796204},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6202414035797119},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5774867534637451},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5389583110809326},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5112712383270264},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4766177237033844},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4404177963733673},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4376840889453888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42343616485595703},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4229309856891632},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4182060658931732},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3812488317489624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33599287271499634},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.18345284461975098},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0998995304107666},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08254513144493103},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.06909579038619995},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.06071269512176514},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.056071937084198}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.8203610777854919},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7844074368476868},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6433542370796204},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6202414035797119},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5774867534637451},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5389583110809326},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5112712383270264},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4766177237033844},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4404177963733673},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4376840889453888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42343616485595703},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4229309856891632},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4182060658931732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3812488317489624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33599287271499634},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.18345284461975098},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0998995304107666},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08254513144493103},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.06909579038619995},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.06071269512176514},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.056071937084198},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-45061-0_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45061-0_16","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.124.763","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.763","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/~klc39/drmst.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.9703","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.9703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~arora/pubs/drmst.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W307896644","https://openalex.org/W1515796352","https://openalex.org/W1520111182","https://openalex.org/W1527583442","https://openalex.org/W1556911662","https://openalex.org/W1600533941","https://openalex.org/W1968165428","https://openalex.org/W1977541023","https://openalex.org/W1990313671","https://openalex.org/W1994248285","https://openalex.org/W2002985966","https://openalex.org/W2011595401","https://openalex.org/W2014068360","https://openalex.org/W2020284736","https://openalex.org/W2022563199","https://openalex.org/W2110367141","https://openalex.org/W2165142526","https://openalex.org/W2167579893","https://openalex.org/W3099328339","https://openalex.org/W6631309767","https://openalex.org/W7026635939"],"related_works":["https://openalex.org/W1985149601","https://openalex.org/W2076522498","https://openalex.org/W3082422232","https://openalex.org/W620960161","https://openalex.org/W1964611452","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W1514905840","https://openalex.org/W1553492721","https://openalex.org/W1998126097"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}