{"id":"https://openalex.org/W2782288225","doi":"https://doi.org/10.1137/1.9781611975055.6","title":"Faster Approximation Algorithm for the <i>k</i>-Regret Minimizing Set and Related Problems","display_name":"Faster Approximation Algorithm for the <i>k</i>-Regret Minimizing Set and Related Problems","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2782288225","doi":"https://doi.org/10.1137/1.9781611975055.6","mag":"2782288225"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611975055.6","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611975055.6","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"},"type":"book-chapter","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/A5074936673","display_name":"Nirman Kumar","orcid":"https://orcid.org/0000-0001-6601-2790"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nirman Kumar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015883931","display_name":"Stavros Sintos","orcid":"https://orcid.org/0000-0002-2114-8886"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stavros Sintos","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074936673"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2083,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.97013614,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"62","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9785000085830688,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9260907173156738},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.615110456943512},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.574207067489624},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5741942524909973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5620321035385132},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45735517144203186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43861469626426697},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4245643615722656},{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.42329180240631104},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.42203187942504883},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3662640452384949},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32703959941864014},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1658177673816681},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09736573696136475}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.9260907173156738},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.615110456943512},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.574207067489624},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5741942524909973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5620321035385132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45735517144203186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43861469626426697},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4245643615722656},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.42329180240631104},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.42203187942504883},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3662640452384949},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32703959941864014},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1658177673816681},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09736573696136475},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611975055.6","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611975055.6","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W79208629","https://openalex.org/W1971511288","https://openalex.org/W1981313592","https://openalex.org/W1993324779","https://openalex.org/W2104211550","https://openalex.org/W2113952707","https://openalex.org/W2139959487","https://openalex.org/W2156887552","https://openalex.org/W2161973620","https://openalex.org/W2170188482","https://openalex.org/W2196086164","https://openalex.org/W2290570034","https://openalex.org/W2478804935","https://openalex.org/W2605247353","https://openalex.org/W2612011639"],"related_works":["https://openalex.org/W4376155396","https://openalex.org/W2971351794","https://openalex.org/W1947085858","https://openalex.org/W2101991911","https://openalex.org/W2174986909","https://openalex.org/W2527791220","https://openalex.org/W2155070487","https://openalex.org/W4311589891","https://openalex.org/W3123835761","https://openalex.org/W118270247"],"abstract_inverted_index":{"Efficient":[0],"multi-criteria":[1],"decision":[2],"making":[3],"often":[4],"requires":[5],"looking":[6],"at":[7],"a":[8,15,35,49],"small":[9,50],"set":[10,30,37,98,176],"of":[11,38,77,113,137,148,165],"representative":[12,24,51],"objects":[13,25,39],"from":[14],"large":[16,36],"collection.":[17],"A":[18],"recently":[19],"proposed":[20],"method":[21],"for":[22,55,94,117,162],"finding":[23],"is":[26,46,60,70,170],"the":[27,44,65,75,78,84,95,108,118,145,149,166,172],"k-regret":[28,96],"minimizing":[29,97,175],"(k-RMS":[31],"problem).":[32],"Intuitively,":[33],"given":[34],"(points)":[40],"in":[41,64,83],"d":[42],"dimensions,":[43],"goal":[45],"to":[47],"choose":[48],"subset,":[52],"such":[53],"that":[54,134],"every":[56],"user":[57],"preference,":[58],"there":[59],"always":[61],"an":[62,155,163],"object":[63,82],"subset":[66],"whose":[67],"preference":[68],"score":[69,76],"not":[71],"much":[72],"worse":[73],"than":[74,144],"k-th":[79],"most":[80],"preferred":[81],"original":[85],"set.":[86],"We":[87],"propose":[88],"two":[89],"new":[90],"efficient":[91,156],"approximation":[92,115,157],"algorithms":[93,105,116,140],"problem":[99],"with":[100,159],"provable":[101],"theoretical":[102,139,160],"guarantees.":[103],"Our":[104],"improve":[106],"on":[107,127],"space":[109],"and":[110,129],"time":[111],"complexities":[112],"previous":[114,146],"k-RMS":[119,150,167],"problem.":[120,151,177],"In":[121],"addition,":[122],"we":[123,153],"run":[124,141],"extensive":[125],"experiments":[126],"real":[128],"synthetic":[130],"data":[131],"sets":[132],"showing":[133],"simple":[135],"modifications":[136],"our":[138],"significantly":[142],"faster":[143],"implementations":[147],"Finally,":[152],"present":[154],"algorithm":[158],"guarantees":[161],"extension":[164],"problem,":[168],"which":[169],"called":[171],"Top-k":[173],"regret":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}