{"id":"https://openalex.org/W330735796","doi":"https://doi.org/10.1007/s00453-007-9124-4","title":"Models of Greedy Algorithms for Graph Problems","display_name":"Models of Greedy Algorithms for Graph Problems","publication_year":2007,"publication_date":"2007-11-27","ids":{"openalex":"https://openalex.org/W330735796","doi":"https://doi.org/10.1007/s00453-007-9124-4","mag":"330735796"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9124-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9124-4","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/A5091281372","display_name":"Sashka Davis","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sashka Davis","raw_affiliation_strings":["University of California, San Diego, USA","University of California. San Diego, USA"],"affiliations":[{"raw_affiliation_string":"University of California, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California. San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002208831","display_name":"Russell Impagliazzo","orcid":"https://orcid.org/0000-0003-3236-9796"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Russell Impagliazzo","raw_affiliation_strings":["University of California, San Diego, USA","University of California. San Diego, USA"],"affiliations":[{"raw_affiliation_string":"University of California, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California. San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091281372"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.02600195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"54","issue":"3","first_page":"269","last_page":"317"},"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.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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.9984999895095825,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6758124232292175},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5919275879859924},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5610926747322083},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5196132063865662},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5015738010406494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.495919793844223},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4906369745731354},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46782153844833374},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4615248739719391},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45940083265304565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4085410535335541},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4005405306816101},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3937453627586365},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3480859398841858},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.2599509358406067}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6758124232292175},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5919275879859924},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5610926747322083},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5196132063865662},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5015738010406494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.495919793844223},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4906369745731354},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46782153844833374},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4615248739719391},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45940083265304565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4085410535335541},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4005405306816101},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3937453627586365},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3480859398841858},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2599509358406067},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-007-9124-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9124-4","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":"mag:330735796","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc12.html#TR05-120","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1971749164","https://openalex.org/W1975290397","https://openalex.org/W1999518031","https://openalex.org/W2022712087","https://openalex.org/W2039298646","https://openalex.org/W2040924621","https://openalex.org/W2070664846","https://openalex.org/W2082150701","https://openalex.org/W2087598714","https://openalex.org/W2101017768","https://openalex.org/W2108249248","https://openalex.org/W2112263237","https://openalex.org/W2132274124","https://openalex.org/W2143698439","https://openalex.org/W2146823188","https://openalex.org/W2151077859","https://openalex.org/W3136693265"],"related_works":["https://openalex.org/W2078047960","https://openalex.org/W2144407406","https://openalex.org/W2364222140","https://openalex.org/W1541239238","https://openalex.org/W3211025827","https://openalex.org/W2039130930","https://openalex.org/W2440719976","https://openalex.org/W2105365164","https://openalex.org/W2058208407","https://openalex.org/W3111792106","https://openalex.org/W1971398538","https://openalex.org/W2035700242","https://openalex.org/W2952576310","https://openalex.org/W2018593731","https://openalex.org/W1577360600","https://openalex.org/W1985159132","https://openalex.org/W2025050335","https://openalex.org/W1585379182","https://openalex.org/W2908273849","https://openalex.org/W2990814010"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}