Home › Entities › academia › Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality

Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality

Research article (Proceedings of the 2018 International Conference on Management of Data, 2018) · cited 56× · AI/ML
academia openalex:W2791243274
Press Enter · cited answer in seconds

Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality

Summary

Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality is a scholarly article[1].

Key Facts

  • Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality. Retrieved May 24, 2026, from https://4ort.xyz/entity/efficient-k-regret-query-algorithm-with-restriction-free-bound-for-any-dimensionality
MLA “Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/efficient-k-regret-query-algorithm-with-restriction-free-bound-for-any-dimensionality.
BibTeX @misc{4ortxyz_efficient-k-regret-query-algorithm-with-restriction-free-bound-for-any-dimensionality_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality}}, year = {2026}, url = {https://4ort.xyz/entity/efficient-k-regret-query-algorithm-with-restriction-free-bound-for-any-dimensionality}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality — https://4ort.xyz/entity/efficient-k-regret-query-algorithm-with-restriction-free-bound-for-any-dimensionality (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/efficient-k-regret-query-algorithm-with-restriction-free-bound-for-any-dimensionality · Last refreshed: