In the Search of Optimal Tree Networks: Hardness and Heuristics Article Swipe
Pavel Martynov
,
Maxim Buzdalov
,
Sergey Pankratov
,
Vitaly Aksenov
,
Stefan Schmid
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1145/3712256.3726425
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1145/3712256.3726425
Traffic in datacenters may follow some pattern: some pairs of servers communicate more frequently than others. Demand-oblivious networks may perform poorly for such workloads, and demand-aware networks optimized for traffic should be used instead. Unfortunately, not all shapes of networks are feasible in real hardware. Practical limitations are usually provided in the form of a topology. For example, a network may be required to be a binary tree, a bounded-degree graph or a Fat tree. In this work, we consider a topology of a binary tree, one of the most fundamental network topologies. We show that already finding an optimal demand-aware binary tree network is NP-hard. Then, we explore how various optimization techniques, including simple local searches, as well as deterministic mutation and crossover operators, cope with generating efficient tree networks on real-life and synthetic workloads.
Related Topics
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1145/3712256.3726425
- OA Status
- hybrid
- Cited By
- 1
- References
- 40
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4412106652
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4412106652Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1145/3712256.3726425Digital Object Identifier
- Title
-
In the Search of Optimal Tree Networks: Hardness and HeuristicsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-07-08Full publication date if available
- Authors
-
Pavel Martynov, Maxim Buzdalov, Sergey Pankratov, Vitaly Aksenov, Stefan SchmidList of authors in order
- Landing page
-
https://doi.org/10.1145/3712256.3726425Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
hybridOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.1145/3712256.3726425Direct OA link when available
- Concepts
-
Heuristics, Computer science, Tree (set theory), Mathematics, Combinatorics, Operating systemTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1Per-year citation counts (last 5 years)
- References (count)
-
40Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4412106652 |
|---|---|
| doi | https://doi.org/10.1145/3712256.3726425 |
| ids.doi | https://doi.org/10.1145/3712256.3726425 |
| ids.openalex | https://openalex.org/W4412106652 |
| fwci | 6.53333352 |
| type | article |
| title | In the Search of Optimal Tree Networks: Hardness and Heuristics |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 257 |
| biblio.first_page | 249 |
| topics[0].id | https://openalex.org/T10374 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9959999918937683 |
| 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 Graph Theory Research |
| topics[1].id | https://openalex.org/T11522 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9955999851226807 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2208 |
| topics[1].subfield.display_name | Electrical and Electronic Engineering |
| topics[1].display_name | VLSI and FPGA Design Techniques |
| topics[2].id | https://openalex.org/T11269 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9929999709129333 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Algorithms and Data Compression |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C127705205 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7749453783035278 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q5748245 |
| concepts[0].display_name | Heuristics |
| concepts[1].id | https://openalex.org/C41008148 |
| concepts[1].level | 0 |
| concepts[1].score | 0.6080475449562073 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[1].display_name | Computer science |
| concepts[2].id | https://openalex.org/C113174947 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5078263878822327 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q2859736 |
| concepts[2].display_name | Tree (set theory) |
| concepts[3].id | https://openalex.org/C33923547 |
| concepts[3].level | 0 |
| concepts[3].score | 0.19408360123634338 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[3].display_name | Mathematics |
| concepts[4].id | https://openalex.org/C114614502 |
| concepts[4].level | 1 |
| concepts[4].score | 0.11813077330589294 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[4].display_name | Combinatorics |
| concepts[5].id | https://openalex.org/C111919701 |
| concepts[5].level | 1 |
| concepts[5].score | 0.05619913339614868 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[5].display_name | Operating system |
| keywords[0].id | https://openalex.org/keywords/heuristics |
| keywords[0].score | 0.7749453783035278 |
| keywords[0].display_name | Heuristics |
| keywords[1].id | https://openalex.org/keywords/computer-science |
| keywords[1].score | 0.6080475449562073 |
| keywords[1].display_name | Computer science |
| keywords[2].id | https://openalex.org/keywords/tree |
| keywords[2].score | 0.5078263878822327 |
| keywords[2].display_name | Tree (set theory) |
| keywords[3].id | https://openalex.org/keywords/mathematics |
| keywords[3].score | 0.19408360123634338 |
| keywords[3].display_name | Mathematics |
| keywords[4].id | https://openalex.org/keywords/combinatorics |
| keywords[4].score | 0.11813077330589294 |
| keywords[4].display_name | Combinatorics |
| keywords[5].id | https://openalex.org/keywords/operating-system |
| keywords[5].score | 0.05619913339614868 |
| keywords[5].display_name | Operating system |
| language | en |
| locations[0].id | doi:10.1145/3712256.3726425 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4363608932 |
| locations[0].source.issn | |
| locations[0].source.type | conference |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Proceedings of the Genetic and Evolutionary Computation Conference |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | cc-by |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Proceedings of the Genetic and Evolutionary Computation Conference |
| locations[0].landing_page_url | https://doi.org/10.1145/3712256.3726425 |
| locations[1].id | pmh:oai:openaccess.city.ac.uk:35542 |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306401940 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | City Research Online (City University London) |
| locations[1].source.host_organization | https://openalex.org/I180825142 |
| locations[1].source.host_organization_name | City, University of London |
| locations[1].source.host_organization_lineage | https://openalex.org/I180825142 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | acceptedVersion |
| locations[1].raw_type | PeerReviewed |
| locations[1].license_id | |
| locations[1].is_accepted | True |
| locations[1].is_published | False |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://openaccess.city.ac.uk/view/creators_id/vitaly=2Eaksenov.html> |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5118856138 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Pavel Martynov |
| authorships[0].affiliations[0].raw_affiliation_string | Jane Street, London, United Kingdom |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Pavel Martynov |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Jane Street, London, United Kingdom |
| authorships[1].author.id | https://openalex.org/A5062797646 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-7120-8824 |
| authorships[1].author.display_name | Maxim Buzdalov |
| authorships[1].countries | GB |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I16038530 |
| authorships[1].affiliations[0].raw_affiliation_string | Aberystwyth University, Aberystwyth, United Kingdom |
| authorships[1].institutions[0].id | https://openalex.org/I16038530 |
| authorships[1].institutions[0].ror | https://ror.org/015m2p889 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I16038530 |
| authorships[1].institutions[0].country_code | GB |
| authorships[1].institutions[0].display_name | Aberystwyth University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Maxim Buzdalov |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Aberystwyth University, Aberystwyth, United Kingdom |
| authorships[2].author.id | https://openalex.org/A5118856139 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Sergey Pankratov |
| authorships[2].countries | AT |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I157556583 |
| authorships[2].affiliations[0].raw_affiliation_string | Institute of Science and Technology Austria, Klosterneuburg, Austria |
| authorships[2].institutions[0].id | https://openalex.org/I157556583 |
| authorships[2].institutions[0].ror | https://ror.org/03gnh5541 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I157556583 |
| authorships[2].institutions[0].country_code | AT |
| authorships[2].institutions[0].display_name | Institute of Science and Technology Austria |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Sergey Pankratov |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Institute of Science and Technology Austria, Klosterneuburg, Austria |
| authorships[3].author.id | https://openalex.org/A5069723237 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-9134-5490 |
| authorships[3].author.display_name | Vitaly Aksenov |
| authorships[3].countries | GB, RU |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I173089394 |
| authorships[3].affiliations[0].raw_affiliation_string | ITMO University, Saint Petersburg, Russian Federation |
| authorships[3].affiliations[1].institution_ids | https://openalex.org/I165862685, https://openalex.org/I4401726869 |
| authorships[3].affiliations[1].raw_affiliation_string | City St George's, University of London, London, United Kingdom |
| authorships[3].institutions[0].id | https://openalex.org/I4401726869 |
| authorships[3].institutions[0].ror | https://ror.org/047ybhc09 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I124357947, https://openalex.org/I4401726869 |
| authorships[3].institutions[0].country_code | |
| authorships[3].institutions[0].display_name | City St George's, University of London |
| authorships[3].institutions[1].id | https://openalex.org/I165862685 |
| authorships[3].institutions[1].ror | https://ror.org/040f08y74 |
| authorships[3].institutions[1].type | education |
| authorships[3].institutions[1].lineage | https://openalex.org/I124357947, https://openalex.org/I165862685 |
| authorships[3].institutions[1].country_code | GB |
| authorships[3].institutions[1].display_name | St George's, University of London |
| authorships[3].institutions[2].id | https://openalex.org/I173089394 |
| authorships[3].institutions[2].ror | https://ror.org/04txgxn49 |
| authorships[3].institutions[2].type | education |
| authorships[3].institutions[2].lineage | https://openalex.org/I173089394 |
| authorships[3].institutions[2].country_code | RU |
| authorships[3].institutions[2].display_name | ITMO University |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Vitaliy Aksenov |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | City St George's, University of London, London, United Kingdom, ITMO University, Saint Petersburg, Russian Federation |
| authorships[4].author.id | https://openalex.org/A5066080641 |
| authorships[4].author.orcid | https://orcid.org/0000-0002-7798-1711 |
| authorships[4].author.display_name | Stefan Schmid |
| authorships[4].countries | DE |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I4577782 |
| authorships[4].affiliations[0].raw_affiliation_string | Technical University of Berlin, Berlin, Germany |
| authorships[4].institutions[0].id | https://openalex.org/I4577782 |
| authorships[4].institutions[0].ror | https://ror.org/03v4gjf40 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I4577782 |
| authorships[4].institutions[0].country_code | DE |
| authorships[4].institutions[0].display_name | Technische Universität Berlin |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Stefan Schmid |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Technical University of Berlin, Berlin, Germany |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.1145/3712256.3726425 |
| open_access.oa_status | hybrid |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | In the Search of Optimal Tree Networks: Hardness and Heuristics |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10374 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9959999918937683 |
| 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 Graph Theory Research |
| related_works | https://openalex.org/W4391375266, https://openalex.org/W2899084033, https://openalex.org/W2748952813, https://openalex.org/W2280422768, https://openalex.org/W3143197806, https://openalex.org/W4252555497, https://openalex.org/W3121175838, https://openalex.org/W3016293053, https://openalex.org/W1690653314, https://openalex.org/W2275524962 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | doi:10.1145/3712256.3726425 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4363608932 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | conference |
| best_oa_location.source.is_oa | False |
| 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 | Proceedings of the Genetic and Evolutionary Computation Conference |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | proceedings-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Proceedings of the Genetic and Evolutionary Computation Conference |
| best_oa_location.landing_page_url | https://doi.org/10.1145/3712256.3726425 |
| primary_location.id | doi:10.1145/3712256.3726425 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4363608932 |
| primary_location.source.issn | |
| primary_location.source.type | conference |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Proceedings of the Genetic and Evolutionary Computation Conference |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | cc-by |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Proceedings of the Genetic and Evolutionary Computation Conference |
| primary_location.landing_page_url | https://doi.org/10.1145/3712256.3726425 |
| publication_date | 2025-07-08 |
| publication_year | 2025 |
| referenced_works | https://openalex.org/W2112173609, https://openalex.org/W4232284301, https://openalex.org/W4256632036, https://openalex.org/W2782300365, https://openalex.org/W6737734972, https://openalex.org/W4226021879, https://openalex.org/W2819181356, https://openalex.org/W3195461621, https://openalex.org/W3036783558, https://openalex.org/W2588207035, https://openalex.org/W2096166399, https://openalex.org/W1170402926, https://openalex.org/W2810723790, https://openalex.org/W2030087828, https://openalex.org/W2017708378, https://openalex.org/W372717656, https://openalex.org/W592494983, https://openalex.org/W1965680834, https://openalex.org/W2042876290, https://openalex.org/W1972978214, https://openalex.org/W2022563199, https://openalex.org/W2315437335, https://openalex.org/W2111935653, https://openalex.org/W2187785713, https://openalex.org/W2044146725, https://openalex.org/W2924572169, https://openalex.org/W2915402362, https://openalex.org/W4252684946, https://openalex.org/W2768671897, https://openalex.org/W2607589993, https://openalex.org/W2914997739, https://openalex.org/W1523565998, https://openalex.org/W4255739665, https://openalex.org/W4321359614, https://openalex.org/W4285805590, https://openalex.org/W4289762770, https://openalex.org/W4244835107, https://openalex.org/W2914379250, https://openalex.org/W2582743722, https://openalex.org/W2614467483 |
| referenced_works_count | 40 |
| abstract_inverted_index.a | 54, 58, 65, 68, 72, 80, 83 |
| abstract_inverted_index.In | 75 |
| abstract_inverted_index.We | 93 |
| abstract_inverted_index.an | 98 |
| abstract_inverted_index.as | 117, 119 |
| abstract_inverted_index.be | 31, 61, 64 |
| abstract_inverted_index.in | 1, 42, 50 |
| abstract_inverted_index.is | 104 |
| abstract_inverted_index.of | 9, 38, 53, 82, 87 |
| abstract_inverted_index.on | 131 |
| abstract_inverted_index.or | 71 |
| abstract_inverted_index.to | 63 |
| abstract_inverted_index.we | 78, 107 |
| abstract_inverted_index.Fat | 73 |
| abstract_inverted_index.For | 56 |
| abstract_inverted_index.all | 36 |
| abstract_inverted_index.and | 24, 122, 133 |
| abstract_inverted_index.are | 40, 47 |
| abstract_inverted_index.for | 21, 28 |
| abstract_inverted_index.how | 109 |
| abstract_inverted_index.may | 3, 18, 60 |
| abstract_inverted_index.not | 35 |
| abstract_inverted_index.one | 86 |
| abstract_inverted_index.the | 51, 88 |
| abstract_inverted_index.cope | 125 |
| abstract_inverted_index.form | 52 |
| abstract_inverted_index.more | 12 |
| abstract_inverted_index.most | 89 |
| abstract_inverted_index.real | 43 |
| abstract_inverted_index.show | 94 |
| abstract_inverted_index.some | 5, 7 |
| abstract_inverted_index.such | 22 |
| abstract_inverted_index.than | 14 |
| abstract_inverted_index.that | 95 |
| abstract_inverted_index.this | 76 |
| abstract_inverted_index.tree | 102, 129 |
| abstract_inverted_index.used | 32 |
| abstract_inverted_index.well | 118 |
| abstract_inverted_index.with | 126 |
| abstract_inverted_index.Then, | 106 |
| abstract_inverted_index.graph | 70 |
| abstract_inverted_index.local | 115 |
| abstract_inverted_index.pairs | 8 |
| abstract_inverted_index.tree, | 67, 85 |
| abstract_inverted_index.tree. | 74 |
| abstract_inverted_index.work, | 77 |
| abstract_inverted_index.binary | 66, 84, 101 |
| abstract_inverted_index.follow | 4 |
| abstract_inverted_index.poorly | 20 |
| abstract_inverted_index.shapes | 37 |
| abstract_inverted_index.should | 30 |
| abstract_inverted_index.simple | 114 |
| abstract_inverted_index.Traffic | 0 |
| abstract_inverted_index.already | 96 |
| abstract_inverted_index.explore | 108 |
| abstract_inverted_index.finding | 97 |
| abstract_inverted_index.network | 59, 91, 103 |
| abstract_inverted_index.optimal | 99 |
| abstract_inverted_index.others. | 15 |
| abstract_inverted_index.perform | 19 |
| abstract_inverted_index.servers | 10 |
| abstract_inverted_index.traffic | 29 |
| abstract_inverted_index.usually | 48 |
| abstract_inverted_index.various | 110 |
| abstract_inverted_index.NP-hard. | 105 |
| abstract_inverted_index.consider | 79 |
| abstract_inverted_index.example, | 57 |
| abstract_inverted_index.feasible | 41 |
| abstract_inverted_index.instead. | 33 |
| abstract_inverted_index.mutation | 121 |
| abstract_inverted_index.networks | 17, 26, 39, 130 |
| abstract_inverted_index.pattern: | 6 |
| abstract_inverted_index.provided | 49 |
| abstract_inverted_index.required | 62 |
| abstract_inverted_index.topology | 81 |
| abstract_inverted_index.Practical | 45 |
| abstract_inverted_index.crossover | 123 |
| abstract_inverted_index.efficient | 128 |
| abstract_inverted_index.hardware. | 44 |
| abstract_inverted_index.including | 113 |
| abstract_inverted_index.optimized | 27 |
| abstract_inverted_index.real-life | 132 |
| abstract_inverted_index.searches, | 116 |
| abstract_inverted_index.synthetic | 134 |
| abstract_inverted_index.topology. | 55 |
| abstract_inverted_index.frequently | 13 |
| abstract_inverted_index.generating | 127 |
| abstract_inverted_index.operators, | 124 |
| abstract_inverted_index.workloads, | 23 |
| abstract_inverted_index.workloads. | 135 |
| abstract_inverted_index.communicate | 11 |
| abstract_inverted_index.datacenters | 2 |
| abstract_inverted_index.fundamental | 90 |
| abstract_inverted_index.limitations | 46 |
| abstract_inverted_index.techniques, | 112 |
| abstract_inverted_index.topologies. | 92 |
| abstract_inverted_index.demand-aware | 25, 100 |
| abstract_inverted_index.optimization | 111 |
| abstract_inverted_index.deterministic | 120 |
| abstract_inverted_index.Unfortunately, | 34 |
| abstract_inverted_index.bounded-degree | 69 |
| abstract_inverted_index.Demand-oblivious | 16 |
| cited_by_percentile_year.max | 95 |
| cited_by_percentile_year.min | 91 |
| countries_distinct_count | 4 |
| institutions_distinct_count | 5 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/13 |
| sustainable_development_goals[0].score | 0.41999998688697815 |
| sustainable_development_goals[0].display_name | Climate action |
| citation_normalized_percentile.value | 0.91631799 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |