{"id":"https://openalex.org/W79208629","doi":"https://doi.org/10.14778/2732269.2732275","title":"Computing k-regret minimizing sets","display_name":"Computing k-regret minimizing sets","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W79208629","doi":"https://doi.org/10.14778/2732269.2732275","mag":"79208629"},"language":"en","primary_location":{"id":"doi:10.14778/2732269.2732275","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2732269.2732275","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","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/A5026802396","display_name":"Sean Chester","orcid":"https://orcid.org/0000-0002-1065-605X"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sean Chester","raw_affiliation_strings":["University of Victoria, Victoria, Canada","[University of Victoria, Victoria, Canada]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"[University of Victoria, Victoria, Canada]","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011013528","display_name":"Alex Thomo","orcid":"https://orcid.org/0000-0002-3020-2258"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alex Thomo","raw_affiliation_strings":["University of Victoria, Victoria, Canada","[University of Victoria, Victoria, Canada]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"[University of Victoria, Victoria, Canada]","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":null,"display_name":"S. Venkatesh","orcid":null},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S. Venkatesh","raw_affiliation_strings":["University of Victoria, Victoria, Canada","[University of Victoria, Victoria, Canada]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"[University of Victoria, Victoria, Canada]","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036116001","display_name":"Sue Whitesides","orcid":null},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sue Whitesides","raw_affiliation_strings":["University of Victoria, Victoria, Canada","[University of Victoria, Victoria, Canada]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"[University of Victoria, Victoria, Canada]","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":null,"apc_paid":null,"fwci":3.1861,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.92107566,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"7","issue":"5","first_page":"389","last_page":"400"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.7736336588859558},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6279329061508179},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5996623039245605},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5916169881820679},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5298452377319336},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4959336221218109},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4957174062728882},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47394824028015137},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4507444500923157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44986769556999207},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42631298303604126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4171680808067322},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37891191244125366},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.359561562538147},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07522940635681152}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7736336588859558},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6279329061508179},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5996623039245605},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5916169881820679},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5298452377319336},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4959336221218109},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4957174062728882},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47394824028015137},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4507444500923157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44986769556999207},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42631298303604126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4171680808067322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37891191244125366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.359561562538147},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07522940635681152},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/2732269.2732275","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2732269.2732275","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.407.5653","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.5653","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.vldb.org/pvldb/vol7/p389-chester.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W19152935","https://openalex.org/W1563424464","https://openalex.org/W1975442866","https://openalex.org/W1999334496","https://openalex.org/W2009688537","https://openalex.org/W2019082936","https://openalex.org/W2019227847","https://openalex.org/W2038730428","https://openalex.org/W2053001144","https://openalex.org/W2057976248","https://openalex.org/W2092181172","https://openalex.org/W2099328971","https://openalex.org/W2104211550","https://openalex.org/W2104322506","https://openalex.org/W2113295349","https://openalex.org/W2116434582","https://openalex.org/W2118207282","https://openalex.org/W2119806435","https://openalex.org/W2146831356","https://openalex.org/W2149332744","https://openalex.org/W2153516800","https://openalex.org/W2153750692","https://openalex.org/W2157734198","https://openalex.org/W2170188482","https://openalex.org/W2401610261","https://openalex.org/W4206237997","https://openalex.org/W4285719527","https://openalex.org/W4412307558","https://openalex.org/W6674656098"],"related_works":["https://openalex.org/W2185409389","https://openalex.org/W2109445739","https://openalex.org/W3111617249","https://openalex.org/W2515987778","https://openalex.org/W4287555357","https://openalex.org/W4205854323","https://openalex.org/W2020662107","https://openalex.org/W3176362036","https://openalex.org/W2575682651","https://openalex.org/W1969256273"],"abstract_inverted_index":{"Regret":[0],"minimizing":[1,69],"sets":[2],"are":[3],"a":[4,9,13,48,72,78],"recent":[5],"approach":[6],"to":[7,43,66,82,122],"representing":[8],"dataset":[10],"D":[11,39,157],"by":[12],"small":[14,160],"subset":[15,49],"R":[16,26,36,50,76,149],"of":[17,20,106,150,162],"size":[18,153],"r":[19],"representative":[21],"data":[22],"points.":[23],"The":[24],"set":[25],"is":[27,40,100],"chosen":[28],"such":[29,47],"that":[30,154],"executing":[31],"any":[32,44],"top-1":[33,73],"query":[34,74],"on":[35,75,86,119,139],"rather":[37],"than":[38,165],"minimally":[41],"perceptible":[42],"user.":[45],"However,":[46],"may":[51],"not":[52],"exist,":[53],"even":[54],"for":[55],"modest":[56],"sizes,":[57],"r.":[58],"In":[59],"this":[60,98],"paper,":[61],"we":[62,109,130,145],"introduce":[63],"the":[64,83,96,103],"relaxation":[65],"k":[67,85,163],"-regret":[68],"sets,":[70],"whereby":[71],"returns":[77],"result":[79],"imperceptibly":[80],"close":[81],"top-":[84],"D.":[87],"We":[88],"show":[89],"that,":[90],"in":[91],"general,":[92],"with":[93],"or":[94],"without":[95],"relaxation,":[97],"problem":[99],"NP-hard.":[101],"For":[102,127],"specific":[104],"case":[105],"two":[107],"dimensions,":[108],"give":[110,131],"an":[111,124,132],"efficient":[112],"dynamic":[113],"programming,":[114],"plane":[115],"sweep":[116],"algorithm":[117,137],"based":[118,138],"geometric":[120],"duality":[121],"find":[123,147],"optimal":[125],"solution.":[126],"arbitrary":[128],"dimension,":[129],"empirically":[133],"effective,":[134],"greedy,":[135],"randomized":[136],"linear":[140],"programming.":[141],"With":[142],"these":[143],"algorithms,":[144],"can":[146],"subsets":[148],"much":[151],"smaller":[152],"better":[155],"summarize":[156],",":[158],"using":[159],"values":[161],"larger":[164],"1.":[166]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}