{"id":"https://openalex.org/W2138522610","doi":"https://doi.org/10.1007/s00453-008-9171-5","title":"Approximation Algorithms for Requirement Cut on\u00a0Graphs","display_name":"Approximation Algorithms for Requirement Cut on\u00a0Graphs","publication_year":2008,"publication_date":"2008-01-28","ids":{"openalex":"https://openalex.org/W2138522610","doi":"https://doi.org/10.1007/s00453-008-9171-5","mag":"2138522610"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9171-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9171-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5051270969","display_name":"Viswanath Nagarajan","orcid":"https://orcid.org/0000-0002-9514-5581"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Viswanath Nagarajan","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, 15213, USA","Carnegie Mellon University, Tepper School of Business, 15213, Pittsburgh, PA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, 15213, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Tepper School of Business, 15213, Pittsburgh, PA, USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, 15213, USA","Carnegie Mellon University, Tepper School of Business, 15213, Pittsburgh, PA, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, 15213, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Tepper School of Business, 15213, Pittsburgh, PA, USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051270969"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.2413,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.81816956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"56","issue":"2","first_page":"198","last_page":"213"},"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.9965999722480774,"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.9965999722480774,"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.9962000250816345,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/combinatorics","display_name":"Combinatorics","score":0.7877681255340576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7095514535903931},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6396916508674622},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6352319121360779},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6059333682060242},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5624886751174927},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5467700362205505},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5066021680831909},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49195119738578796},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.49086982011795044},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4840616285800934},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4281773567199707},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4195244014263153},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26961657404899597},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.16020944714546204}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7877681255340576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7095514535903931},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6396916508674622},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6352319121360779},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6059333682060242},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5624886751174927},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5467700362205505},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5066021680831909},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49195119738578796},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.49086982011795044},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4840616285800934},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4281773567199707},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4195244014263153},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26961657404899597},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.16020944714546204},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-008-9171-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9171-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:repository.cmu.edu:tepper-1383","is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1383&context=tepper","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tepper School of Business","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.8697","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.8697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.andrew.cmu.edu/~viswanat/papers/req-cut.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.2758","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.2758","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.andrew.cmu.edu/user/viswanat/papers/req-cut.pdf","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":31,"referenced_works":["https://openalex.org/W1600160158","https://openalex.org/W1963899113","https://openalex.org/W1970076003","https://openalex.org/W1990666952","https://openalex.org/W1992520677","https://openalex.org/W1993861505","https://openalex.org/W2002531683","https://openalex.org/W2018279087","https://openalex.org/W2020632401","https://openalex.org/W2041499697","https://openalex.org/W2044343300","https://openalex.org/W2082353536","https://openalex.org/W2091004914","https://openalex.org/W2107881198","https://openalex.org/W2112306992","https://openalex.org/W2122466336","https://openalex.org/W2125278290","https://openalex.org/W2143996311","https://openalex.org/W2150148016","https://openalex.org/W2152986618","https://openalex.org/W2154876245","https://openalex.org/W2167236203","https://openalex.org/W2176446742","https://openalex.org/W2177296023","https://openalex.org/W2295428206","https://openalex.org/W3009415557","https://openalex.org/W3030774092","https://openalex.org/W3121576764","https://openalex.org/W4213060883","https://openalex.org/W4231916799","https://openalex.org/W6648140929"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2115772827","https://openalex.org/W4289685524","https://openalex.org/W2885987986","https://openalex.org/W115807216","https://openalex.org/W4235911878","https://openalex.org/W3210180238","https://openalex.org/W2619966450","https://openalex.org/W2068595367","https://openalex.org/W1974139762"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}