{"id":"https://openalex.org/keywords/greedy-approximation","display_name":"greedy approximation","description":"An algorithmic approach that builds an approximate solution through successive locally optimal choices in optimization and computer science.","display_name_alternatives":["greedy approximations","greedy approximation algorithms"],"ids":{"openalex":"https://openalex.org/keywords/greedy-approximation","wikidata":null},"primary_topic":null,"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.1278,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11545","display_name":"Advanced Banach Space Theory","score":0.1083,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0715,"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"}}],"works_count":881,"cited_by_count":33730,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/greedy-approximation","updated_date":"2026-11-17T04:05:58","created_date":"2022-04-12T19:38:12"}
