{"id":"https://openalex.org/W1578891227","doi":"https://doi.org/10.1007/11841036_48","title":"Greedy in Approximation Algorithms","display_name":"Greedy in Approximation Algorithms","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1578891227","doi":"https://doi.org/10.1007/11841036_48","mag":"1578891227"},"language":"en","primary_location":{"id":"doi:10.1007/11841036_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_48","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":"conference-paper","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/A5007528822","display_name":"Juli\u00e1n Mestre","orcid":"https://orcid.org/0000-0003-4948-2998"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Juli\u00e1n Mestre","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, 20742, USA","Department of Computer Science, University of Maryland, College Park, USA","Dept of Computer Science, University of Maryland, College Park MD#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept of Computer Science, University of Maryland, College Park MD#TAB#","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007528822"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4711,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.78280098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"528","last_page":"539"},"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.9993000030517578,"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980000257492065,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9970999956130981,"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.783288836479187},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6337465643882751},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5180661678314209},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4497411847114563},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35440754890441895}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.783288836479187},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6337465643882751},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5180661678314209},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4497411847114563},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35440754890441895}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/11841036_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_48","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.93.4144","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.4144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~jmestre/papers/greedy.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W67184062","https://openalex.org/W1485041102","https://openalex.org/W1563315847","https://openalex.org/W1589898734","https://openalex.org/W1599161138","https://openalex.org/W1599622173","https://openalex.org/W1923579438","https://openalex.org/W1984509778","https://openalex.org/W1991528957","https://openalex.org/W2003476672","https://openalex.org/W2003902046","https://openalex.org/W2008816808","https://openalex.org/W2012959686","https://openalex.org/W2014533003","https://openalex.org/W2019036002","https://openalex.org/W2024607148","https://openalex.org/W2033637560","https://openalex.org/W2089117840","https://openalex.org/W2100658172","https://openalex.org/W2132274124","https://openalex.org/W2161029789","https://openalex.org/W2340149117","https://openalex.org/W2911254713","https://openalex.org/W3136693265","https://openalex.org/W4255288880","https://openalex.org/W4285719527","https://openalex.org/W4297399141"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2163115662","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2544904580"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":6}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}