{"id":"https://openalex.org/W2049083558","doi":"https://doi.org/10.1016/0304-3975(94)00254-g","title":"The complexity and approximability of finding maximum feasible subsystems of linear relations","display_name":"The complexity and approximability of finding maximum feasible subsystems of linear relations","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W2049083558","doi":"https://doi.org/10.1016/0304-3975(94)00254-g","mag":"2049083558"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)00254-g","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00254-g","pdf_url":"https://www.sciencedirect.com/science/article/pii/030439759400254G/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/030439759400254G/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046316138","display_name":"E. Amaldi","orcid":"https://orcid.org/0000-0002-3553-2571"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Edoardo Amaldi","raw_affiliation_strings":["Department of Mathematics, Swiss Federal Institute of Technology, CH-1015 Lausanne, Switzerland","Department of Mathematics, Swiss Federal Institute of Technology, CH-1015, Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Swiss Federal Institute of Technology, CH-1015 Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"Department of Mathematics, Swiss Federal Institute of Technology, CH-1015, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003972927","display_name":"Viggo Kann","orcid":"https://orcid.org/0000-0003-3199-8953"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Viggo Kann","raw_affiliation_strings":["Department of Numerical Analysis, and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden","Department of Numerical Analysis and Computing Science Royal Institute of Technology, S-100 44 Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Numerical Analysis, and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Department of Numerical Analysis and Computing Science Royal Institute of Technology, S-100 44 Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003972927"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":11.8847,"has_fulltext":true,"cited_by_count":203,"citation_normalized_percentile":{"value":0.98494407,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"147","issue":"1-2","first_page":"181","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9980999827384949,"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/T10142","display_name":"Formal Methods in Verification","score":0.9958000183105469,"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.8065645694732666},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6849992871284485},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5614984631538391},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5131014585494995},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5094760060310364},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5018947124481201},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.493717759847641},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4550125002861023},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4414818286895752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15897539258003235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10062184929847717},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07696884870529175}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8065645694732666},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6849992871284485},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5614984631538391},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5131014585494995},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5094760060310364},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5018947124481201},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.493717759847641},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4550125002861023},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4414818286895752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15897539258003235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10062184929847717},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07696884870529175},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/0304-3975(94)00254-g","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00254-g","pdf_url":"https://www.sciencedirect.com/science/article/pii/030439759400254G/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.9283","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.9283","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/Info/People/amaldi/tcs1.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.6655","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6655","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/maxfls.ps","raw_type":"text"},{"id":"pmh:oai:re.public.polimi.it:11311/513545","is_oa":false,"landing_page_url":"http://hdl.handle.net/11311/513545","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/0304-3975(94)00254-g","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00254-g","pdf_url":"https://www.sciencedirect.com/science/article/pii/030439759400254G/pdf","source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2049083558.pdf","grobid_xml":"https://content.openalex.org/works/W2049083558.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W192146155","https://openalex.org/W588234439","https://openalex.org/W1557755441","https://openalex.org/W1963547452","https://openalex.org/W1969341260","https://openalex.org/W1972345639","https://openalex.org/W1978126533","https://openalex.org/W1998400388","https://openalex.org/W2001564241","https://openalex.org/W2011039300","https://openalex.org/W2038225707","https://openalex.org/W2040924621","https://openalex.org/W2041615247","https://openalex.org/W2045168006","https://openalex.org/W2046011049","https://openalex.org/W2053113791","https://openalex.org/W2053651631","https://openalex.org/W2054804336","https://openalex.org/W2055656009","https://openalex.org/W2059453880","https://openalex.org/W2063981365","https://openalex.org/W2082160108","https://openalex.org/W2117124673","https://openalex.org/W2117913620","https://openalex.org/W2124268136","https://openalex.org/W2128033389","https://openalex.org/W2129727551","https://openalex.org/W2132302072","https://openalex.org/W2143391442","https://openalex.org/W2152221184","https://openalex.org/W2611147814","https://openalex.org/W3015981925","https://openalex.org/W3017143921","https://openalex.org/W3022694456","https://openalex.org/W3141386157","https://openalex.org/W4211103065","https://openalex.org/W4233176618","https://openalex.org/W4235946010","https://openalex.org/W4298262456","https://openalex.org/W6617330131","https://openalex.org/W6650788953","https://openalex.org/W6662039146","https://openalex.org/W6674843440","https://openalex.org/W6680109655","https://openalex.org/W6681300758","https://openalex.org/W6776658741","https://openalex.org/W6996888795","https://openalex.org/W7036769531"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W4386900933","https://openalex.org/W4385301946","https://openalex.org/W4297797135","https://openalex.org/W3125672081","https://openalex.org/W1673581201","https://openalex.org/W2991991550","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}