{"id":"https://openalex.org/W2032415540","doi":"https://doi.org/10.1145/2636920","title":"Approximation Algorithms for Min-Max Generalization Problems","display_name":"Approximation Algorithms for Min-Max Generalization Problems","publication_year":2014,"publication_date":"2014-08-25","ids":{"openalex":"https://openalex.org/W2032415540","doi":"https://doi.org/10.1145/2636920","mag":"2032415540"},"language":"en","primary_location":{"id":"doi:10.1145/2636920","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2636920","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","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/A5023910624","display_name":"Piotr Berman","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Piotr Berman","raw_affiliation_strings":["Pennsylvania State University, USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080839778","display_name":"Sofya Raskhodnikova","orcid":"https://orcid.org/0000-0002-4902-050X"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sofya Raskhodnikova","raw_affiliation_strings":["Pennsylvania State University, USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023910624"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.09732655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7694262266159058},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6710134744644165},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6004309058189392},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5919987559318542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5185719132423401},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4711674153804779},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.4138333797454834},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4079141616821289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38528725504875183},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37118449807167053}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7694262266159058},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6710134744644165},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6004309058189392},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5919987559318542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5185719132423401},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4711674153804779},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.4138333797454834},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4079141616821289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38528725504875183},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37118449807167053},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2636920","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2636920","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.75}],"awards":[{"id":"https://openalex.org/G6196682352","display_name":null,"funder_award_id":"CCF-0729171","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G8187807758","display_name":null,"funder_award_id":"CCF-0845701","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W176992488","https://openalex.org/W1488422606","https://openalex.org/W1548832296","https://openalex.org/W1667714990","https://openalex.org/W1975625792","https://openalex.org/W1978593916","https://openalex.org/W1979768555","https://openalex.org/W1983755786","https://openalex.org/W2024624524","https://openalex.org/W2041325117","https://openalex.org/W2050065904","https://openalex.org/W2057764247","https://openalex.org/W2062666771","https://openalex.org/W2062810230","https://openalex.org/W2064628860","https://openalex.org/W2071091006","https://openalex.org/W2077110411","https://openalex.org/W2102201348","https://openalex.org/W2104829661","https://openalex.org/W2168223973","https://openalex.org/W2340006107","https://openalex.org/W4285719527","https://openalex.org/W6607217895"],"related_works":["https://openalex.org/W3162204513","https://openalex.org/W2371138613","https://openalex.org/W2048963458","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2583811263","https://openalex.org/W3173312668","https://openalex.org/W2810695303","https://openalex.org/W3012931947","https://openalex.org/W2035944803"],"abstract_inverted_index":{"We":[0,133],"provide":[1,148],"improved":[2],"approximation":[3,136,164,177],"algorithms":[4,165],"for":[5,138,151,155,166,181],"the":[6,46,62,79,140,156],"min-max":[7,43],"generalization":[8,44],"problems":[9,100,141],"considered":[10,142],"by":[11,143],"Du,":[12],"Eppstein,":[13],"Goodrich,":[14],"and":[15,29,54,61,118,147,172],"Lueker":[16],"[Du":[17],"et":[18,96,145,161],"al.":[19,97,146,162],"2009].":[20],"Generalization":[21],"is":[22,64],"widely":[23],"used":[24],"in":[25,101],"privacy-preserving":[26],"data":[27,50,114],"mining":[28],"can":[30],"also":[31],"be":[32],"viewed":[33],"as":[34],"a":[35,40,55,83,93,106,121],"natural":[36],"way":[37],"of":[38,49,71,82,87],"compressing":[39],"dataset.":[41],"In":[42],"problems,":[45],"input":[47],"consists":[48],"items":[51,68],"with":[52],"weights":[53],"lower":[56],"bound":[57],"w":[58,75],"lb":[59,76],",":[60],"goal":[63],"to":[65,92,187],"partition":[66],"individual":[67],"into":[69,108,115,124],"groups":[70],"weight":[72,81,131],"at":[73],"least":[74],"while":[77],"minimizing":[78],"maximum":[80],"group.":[84],"The":[85],"rules":[86],"legal":[88],"partitioning":[89,105,112,120],"are":[90],"specific":[91,167],"problem.":[94],"Du":[95,144,160],"consider":[98],"several":[99],"this":[102,188],"vein:":[103],"(1)":[104],"graph":[107,168],"connected":[109],"subgraphs,":[110],"(2)":[111],"unstructured":[113],"arbitrary":[116],"classes,":[117],"(3)":[119],"two-dimensional":[122],"array":[123],"contiguous":[125],"rectangles":[126],"(subarrays)":[127],"that":[128,179],"satisfy":[129],"these":[130,152],"requirements.":[132],"significantly":[134],"improve":[135],"ratios":[137],"all":[139,182],"additional":[149],"motivation":[150],"problems.":[153],"Moreover,":[154],"first":[157],"problem,":[158],"whereas":[159],"give":[163],"families,":[169],"namely,":[170],"3-connected":[171],"4-connected":[173],"planar":[174],"graphs,":[175],"no":[176],"algorithm":[178],"works":[180],"graphs":[183],"was":[184],"known":[185],"prior":[186],"work.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}