A general approximation method for bicriteria minimization problems Article Swipe
Pascal Halffmann
,
Stefan Ruzika
,
Clemens Thielen
,
David Willems
·
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1016/j.tcs.2017.07.003
YOU?
·
· 2017
· Open Access
·
· DOI: https://doi.org/10.1016/j.tcs.2017.07.003
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1016/j.tcs.2017.07.003
- OA Status
- green
- Cited By
- 7
- References
- 39
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2953286221
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2953286221Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1016/j.tcs.2017.07.003Digital Object Identifier
- Title
-
A general approximation method for bicriteria minimization problemsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2017Year of publication
- Publication date
-
2017-07-18Full publication date if available
- Authors
-
Pascal Halffmann, Stefan Ruzika, Clemens Thielen, David WillemsList of authors in order
- Landing page
-
https://doi.org/10.1016/j.tcs.2017.07.003Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/1701.02989Direct OA link when available
- Concepts
-
Minification, Maximization, Mathematics, Approximation algorithm, Mathematical optimization, Polynomial-time approximation scheme, Time complexity, Polynomial, Pareto principle, Applied mathematics, Combinatorics, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
7Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1, 2023: 2, 2021: 2, 2018: 2Per-year citation counts (last 5 years)
- References (count)
-
39Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2953286221 |
|---|---|
| doi | https://doi.org/10.1016/j.tcs.2017.07.003 |
| ids.doi | https://doi.org/10.1016/j.tcs.2017.07.003 |
| ids.mag | 2953286221 |
| ids.openalex | https://openalex.org/W2953286221 |
| fwci | 0.59185335 |
| type | article |
| title | A general approximation method for bicriteria minimization problems |
| awards[0].id | https://openalex.org/G2544068286 |
| awards[0].funder_id | https://openalex.org/F4320321114 |
| awards[0].display_name | |
| awards[0].funder_award_id | 13N12825 |
| awards[0].funder_display_name | Bundesministerium für Bildung und Forschung |
| awards[1].id | https://openalex.org/G8507529751 |
| awards[1].funder_id | https://openalex.org/F4320320875 |
| awards[1].display_name | |
| awards[1].funder_award_id | 57128839 |
| awards[1].funder_display_name | Deutscher Akademischer Austauschdienst |
| awards[2].id | https://openalex.org/G6355307955 |
| awards[2].funder_id | https://openalex.org/F4320320879 |
| awards[2].display_name | |
| awards[2].funder_award_id | RU 1524/4-1 |
| awards[2].funder_display_name | Deutsche Forschungsgemeinschaft |
| biblio.issue | |
| biblio.volume | 695 |
| biblio.last_page | 15 |
| biblio.first_page | 1 |
| topics[0].id | https://openalex.org/T10848 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9681000113487244 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1703 |
| topics[0].subfield.display_name | Computational Theory and Mathematics |
| topics[0].display_name | Advanced Multi-Objective Optimization Algorithms |
| topics[1].id | https://openalex.org/T11413 |
| topics[1].field.id | https://openalex.org/fields/18 |
| topics[1].field.display_name | Decision Sciences |
| topics[1].score | 0.9592999815940857 |
| topics[1].domain.id | https://openalex.org/domains/2 |
| topics[1].domain.display_name | Social Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1803 |
| topics[1].subfield.display_name | Management Science and Operations Research |
| topics[1].display_name | Risk and Portfolio Optimization |
| topics[2].id | https://openalex.org/T10928 |
| topics[2].field.id | https://openalex.org/fields/18 |
| topics[2].field.display_name | Decision Sciences |
| topics[2].score | 0.9569000005722046 |
| topics[2].domain.id | https://openalex.org/domains/2 |
| topics[2].domain.display_name | Social Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1804 |
| topics[2].subfield.display_name | Statistics, Probability and Uncertainty |
| topics[2].display_name | Probabilistic and Robust Engineering Design |
| funders[0].id | https://openalex.org/F4320320875 |
| funders[0].ror | https://ror.org/039djdh30 |
| funders[0].display_name | Deutscher Akademischer Austauschdienst |
| funders[1].id | https://openalex.org/F4320320879 |
| funders[1].ror | https://ror.org/018mejw64 |
| funders[1].display_name | Deutsche Forschungsgemeinschaft |
| funders[2].id | https://openalex.org/F4320321114 |
| funders[2].ror | https://ror.org/04pz7b180 |
| funders[2].display_name | Bundesministerium für Bildung und Forschung |
| is_xpac | False |
| apc_list.value | 2690 |
| apc_list.currency | USD |
| apc_list.value_usd | 2690 |
| apc_paid | |
| concepts[0].id | https://openalex.org/C147764199 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7077060341835022 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q6865248 |
| concepts[0].display_name | Minification |
| concepts[1].id | https://openalex.org/C2776330181 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6984413266181946 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q18358244 |
| concepts[1].display_name | Maximization |
| concepts[2].id | https://openalex.org/C33923547 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6394795179367065 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[2].display_name | Mathematics |
| concepts[3].id | https://openalex.org/C148764684 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6075640320777893 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q621751 |
| concepts[3].display_name | Approximation algorithm |
| concepts[4].id | https://openalex.org/C126255220 |
| concepts[4].level | 1 |
| concepts[4].score | 0.5050566792488098 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[4].display_name | Mathematical optimization |
| concepts[5].id | https://openalex.org/C99140742 |
| concepts[5].level | 3 |
| concepts[5].score | 0.4930581748485565 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q843550 |
| concepts[5].display_name | Polynomial-time approximation scheme |
| concepts[6].id | https://openalex.org/C311688 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4908831715583801 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q2393193 |
| concepts[6].display_name | Time complexity |
| concepts[7].id | https://openalex.org/C90119067 |
| concepts[7].level | 2 |
| concepts[7].score | 0.45212769508361816 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q43260 |
| concepts[7].display_name | Polynomial |
| concepts[8].id | https://openalex.org/C137635306 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4450402855873108 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q182667 |
| concepts[8].display_name | Pareto principle |
| concepts[9].id | https://openalex.org/C28826006 |
| concepts[9].level | 1 |
| concepts[9].score | 0.3361101448535919 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q33521 |
| concepts[9].display_name | Applied mathematics |
| concepts[10].id | https://openalex.org/C114614502 |
| concepts[10].level | 1 |
| concepts[10].score | 0.32236161828041077 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[10].display_name | Combinatorics |
| concepts[11].id | https://openalex.org/C134306372 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0643739104270935 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[11].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/minification |
| keywords[0].score | 0.7077060341835022 |
| keywords[0].display_name | Minification |
| keywords[1].id | https://openalex.org/keywords/maximization |
| keywords[1].score | 0.6984413266181946 |
| keywords[1].display_name | Maximization |
| keywords[2].id | https://openalex.org/keywords/mathematics |
| keywords[2].score | 0.6394795179367065 |
| keywords[2].display_name | Mathematics |
| keywords[3].id | https://openalex.org/keywords/approximation-algorithm |
| keywords[3].score | 0.6075640320777893 |
| keywords[3].display_name | Approximation algorithm |
| keywords[4].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[4].score | 0.5050566792488098 |
| keywords[4].display_name | Mathematical optimization |
| keywords[5].id | https://openalex.org/keywords/polynomial-time-approximation-scheme |
| keywords[5].score | 0.4930581748485565 |
| keywords[5].display_name | Polynomial-time approximation scheme |
| keywords[6].id | https://openalex.org/keywords/time-complexity |
| keywords[6].score | 0.4908831715583801 |
| keywords[6].display_name | Time complexity |
| keywords[7].id | https://openalex.org/keywords/polynomial |
| keywords[7].score | 0.45212769508361816 |
| keywords[7].display_name | Polynomial |
| keywords[8].id | https://openalex.org/keywords/pareto-principle |
| keywords[8].score | 0.4450402855873108 |
| keywords[8].display_name | Pareto principle |
| keywords[9].id | https://openalex.org/keywords/applied-mathematics |
| keywords[9].score | 0.3361101448535919 |
| keywords[9].display_name | Applied mathematics |
| keywords[10].id | https://openalex.org/keywords/combinatorics |
| keywords[10].score | 0.32236161828041077 |
| keywords[10].display_name | Combinatorics |
| keywords[11].id | https://openalex.org/keywords/mathematical-analysis |
| keywords[11].score | 0.0643739104270935 |
| keywords[11].display_name | Mathematical analysis |
| language | en |
| locations[0].id | doi:10.1016/j.tcs.2017.07.003 |
| locations[0].is_oa | False |
| locations[0].source.id | https://openalex.org/S90727058 |
| locations[0].source.issn | 0304-3975, 1879-2294 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 0304-3975 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Theoretical Computer Science |
| locations[0].source.host_organization | https://openalex.org/P4310320990 |
| locations[0].source.host_organization_name | Elsevier BV |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310320990 |
| locations[0].source.host_organization_lineage_names | Elsevier BV |
| locations[0].license | publisher-specific-oa |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/publisher-specific-oa |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Theoretical Computer Science |
| locations[0].landing_page_url | https://doi.org/10.1016/j.tcs.2017.07.003 |
| locations[1].id | pmh:oai:arXiv.org:1701.02989 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | https://arxiv.org/pdf/1701.02989 |
| locations[1].version | submittedVersion |
| locations[1].raw_type | text |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | http://arxiv.org/abs/1701.02989 |
| indexed_in | arxiv, crossref |
| authorships[0].author.id | https://openalex.org/A5002307899 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-3462-4941 |
| authorships[0].author.display_name | Pascal Halffmann |
| authorships[0].countries | DE |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I2802076133, https://openalex.org/I4387153937 |
| authorships[0].affiliations[0].raw_affiliation_string | Mathematical Institute, University of Koblenz-Landau, Campus Koblenz, D-56070 Koblenz, Germany |
| authorships[0].institutions[0].id | https://openalex.org/I4387153937 |
| authorships[0].institutions[0].ror | https://ror.org/0433e6t24 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I4387153937 |
| authorships[0].institutions[0].country_code | |
| authorships[0].institutions[0].display_name | Universität Koblenz |
| authorships[0].institutions[1].id | https://openalex.org/I2802076133 |
| authorships[0].institutions[1].ror | https://ror.org/01j9f6752 |
| authorships[0].institutions[1].type | education |
| authorships[0].institutions[1].lineage | https://openalex.org/I2802076133 |
| authorships[0].institutions[1].country_code | DE |
| authorships[0].institutions[1].display_name | University of Koblenz and Landau |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Pascal Halffmann |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Mathematical Institute, University of Koblenz-Landau, Campus Koblenz, D-56070 Koblenz, Germany |
| authorships[1].author.id | https://openalex.org/A5107846021 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Stefan Ruzika |
| authorships[1].countries | DE |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I2802076133, https://openalex.org/I4387153937 |
| authorships[1].affiliations[0].raw_affiliation_string | Mathematical Institute, University of Koblenz-Landau, Campus Koblenz, D-56070 Koblenz, Germany |
| authorships[1].institutions[0].id | https://openalex.org/I4387153937 |
| authorships[1].institutions[0].ror | https://ror.org/0433e6t24 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I4387153937 |
| authorships[1].institutions[0].country_code | |
| authorships[1].institutions[0].display_name | Universität Koblenz |
| authorships[1].institutions[1].id | https://openalex.org/I2802076133 |
| authorships[1].institutions[1].ror | https://ror.org/01j9f6752 |
| authorships[1].institutions[1].type | education |
| authorships[1].institutions[1].lineage | https://openalex.org/I2802076133 |
| authorships[1].institutions[1].country_code | DE |
| authorships[1].institutions[1].display_name | University of Koblenz and Landau |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Stefan Ruzika |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Mathematical Institute, University of Koblenz-Landau, Campus Koblenz, D-56070 Koblenz, Germany |
| authorships[2].author.id | https://openalex.org/A5050306276 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-0897-3571 |
| authorships[2].author.display_name | Clemens Thielen |
| authorships[2].countries | DE |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I153267046 |
| authorships[2].affiliations[0].raw_affiliation_string | Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany |
| authorships[2].institutions[0].id | https://openalex.org/I153267046 |
| authorships[2].institutions[0].ror | https://ror.org/04zrf7b53 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I153267046 |
| authorships[2].institutions[0].country_code | DE |
| authorships[2].institutions[0].display_name | University of Kaiserslautern |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Clemens Thielen |
| authorships[2].is_corresponding | True |
| authorships[2].raw_affiliation_strings | Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany |
| authorships[3].author.id | https://openalex.org/A5030830818 |
| authorships[3].author.orcid | |
| authorships[3].author.display_name | David Willems |
| authorships[3].countries | DE |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I2802076133, https://openalex.org/I4387153937 |
| authorships[3].affiliations[0].raw_affiliation_string | Mathematical Institute, University of Koblenz-Landau, Campus Koblenz, D-56070 Koblenz, Germany |
| authorships[3].institutions[0].id | https://openalex.org/I4387153937 |
| authorships[3].institutions[0].ror | https://ror.org/0433e6t24 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I4387153937 |
| authorships[3].institutions[0].country_code | |
| authorships[3].institutions[0].display_name | Universität Koblenz |
| authorships[3].institutions[1].id | https://openalex.org/I2802076133 |
| authorships[3].institutions[1].ror | https://ror.org/01j9f6752 |
| authorships[3].institutions[1].type | education |
| authorships[3].institutions[1].lineage | https://openalex.org/I2802076133 |
| authorships[3].institutions[1].country_code | DE |
| authorships[3].institutions[1].display_name | University of Koblenz and Landau |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | David Willems |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Mathematical Institute, University of Koblenz-Landau, Campus Koblenz, D-56070 Koblenz, Germany |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/1701.02989 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | A general approximation method for bicriteria minimization problems |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10848 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9681000113487244 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1703 |
| primary_topic.subfield.display_name | Computational Theory and Mathematics |
| primary_topic.display_name | Advanced Multi-Objective Optimization Algorithms |
| related_works | https://openalex.org/W1815446007, https://openalex.org/W2783992526, https://openalex.org/W2048358792, https://openalex.org/W2098281589, https://openalex.org/W1982537107, https://openalex.org/W2970302286, https://openalex.org/W1481223916, https://openalex.org/W2732982824, https://openalex.org/W2962917430, https://openalex.org/W1903284337 |
| cited_by_count | 7 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2023 |
| counts_by_year[1].cited_by_count | 2 |
| counts_by_year[2].year | 2021 |
| counts_by_year[2].cited_by_count | 2 |
| counts_by_year[3].year | 2018 |
| counts_by_year[3].cited_by_count | 2 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:1701.02989 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/1701.02989 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/1701.02989 |
| primary_location.id | doi:10.1016/j.tcs.2017.07.003 |
| primary_location.is_oa | False |
| primary_location.source.id | https://openalex.org/S90727058 |
| primary_location.source.issn | 0304-3975, 1879-2294 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 0304-3975 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Theoretical Computer Science |
| primary_location.source.host_organization | https://openalex.org/P4310320990 |
| primary_location.source.host_organization_name | Elsevier BV |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310320990 |
| primary_location.source.host_organization_lineage_names | Elsevier BV |
| primary_location.license | publisher-specific-oa |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/publisher-specific-oa |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Theoretical Computer Science |
| primary_location.landing_page_url | https://doi.org/10.1016/j.tcs.2017.07.003 |
| publication_date | 2017-07-18 |
| publication_year | 2017 |
| referenced_works | https://openalex.org/W6640090882, https://openalex.org/W2026427926, https://openalex.org/W2039219233, https://openalex.org/W1493541567, https://openalex.org/W2027029507, https://openalex.org/W2097004206, https://openalex.org/W2128953879, https://openalex.org/W2110373411, https://openalex.org/W2593781315, https://openalex.org/W2573044601, https://openalex.org/W2034112563, https://openalex.org/W2061701207, https://openalex.org/W2074117023, https://openalex.org/W2064600658, https://openalex.org/W2047424666, https://openalex.org/W6648072067, https://openalex.org/W6646224836, https://openalex.org/W1992170089, https://openalex.org/W2060882019, https://openalex.org/W3105140593, https://openalex.org/W1567663444, https://openalex.org/W4242104062, https://openalex.org/W2117226423, https://openalex.org/W4302557773, https://openalex.org/W1991055327, https://openalex.org/W109241445, https://openalex.org/W1547227531, https://openalex.org/W1480013811, https://openalex.org/W2550056917, https://openalex.org/W2038190710, https://openalex.org/W4285719527, https://openalex.org/W4292542951, https://openalex.org/W1983383464, https://openalex.org/W1569649260, https://openalex.org/W95866593, https://openalex.org/W1928381443, https://openalex.org/W2917094338, https://openalex.org/W2615258659, https://openalex.org/W2106299112 |
| referenced_works_count | 39 |
| abstract_inverted_index | |
| cited_by_percentile_year.max | 96 |
| cited_by_percentile_year.min | 90 |
| corresponding_author_ids | https://openalex.org/A5050306276 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 4 |
| corresponding_institution_ids | https://openalex.org/I153267046 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/8 |
| sustainable_development_goals[0].score | 0.49000000953674316 |
| sustainable_development_goals[0].display_name | Decent work and economic growth |
| citation_normalized_percentile.value | 0.6973597 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |