{"id":"https://openalex.org/W1966079129","doi":null,"title":"Tight approximation algorithms for maximum general assignment problems","display_name":"Tight approximation algorithms for maximum general assignment problems","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1966079129","mag":"1966079129"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.9162","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.9162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.dartmouth.edu/~lkf/papers/soda06-sap.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5045233402","display_name":"Lisa Fleischer","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lisa Fleischer","raw_affiliation_strings":["IBM T.J. Watson research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson research Center","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112864313","display_name":"Michel X. Goemans","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michel X. Goemans","raw_affiliation_strings":["MIT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075598023","display_name":"Vahab Mirrokni","orcid":"https://orcid.org/0000-0001-6705-5629","observed_orcids":["https://orcid.org/0000-0001-6705-5629"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vahab S. Mirrokni","raw_affiliation_strings":["MIT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111449864","display_name":"Maxim I. Sviridenko","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maxim Sviridenko","raw_affiliation_strings":["IBM T.J. Watson research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson research Center","institution_ids":["https://openalex.org/I4210114115"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.5031,"has_fulltext":false,"cited_by_count":219,"citation_normalized_percentile":{"value":0.99750623,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.8544999957084656,"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.8544999957084656,"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/T12176","display_name":"Optimization and Packing Problems","score":0.11980000138282776,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.00559999980032444,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8199999928474426},{"id":"https://openalex.org/keywords/lp-rounding","display_name":"LP rounding","score":0.9210000038146973},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.9240000247955322},{"id":"https://openalex.org/keywords/integrality-gap","display_name":"integrality gap","score":0.8949999809265137},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.699999988079071},{"id":"https://openalex.org/keywords/fully-polynomial-time-approximation-scheme","display_name":"fully polynomial time approximation scheme","score":0.6069999933242798},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"bin packing","score":0.722000002861023}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8663554191589355},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8036404848098755},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7775170803070068},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.7272140979766846},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6403255462646484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5903772711753845},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.5729115605354309},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5261815786361694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.523237407207489},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.445067822933197},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44378119707107544},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4312084913253784},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42292213439941406},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.4161977767944336},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4086839556694031},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40116259455680847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2680969834327698},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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":"pmh:oai:CiteSeerX.psu:10.1.1.123.9162","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.9162","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.dartmouth.edu/~lkf/papers/soda06-sap.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.2210","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.2210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.mit.edu/~goemans/ga-soda06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1485485988","https://openalex.org/W1500428599","https://openalex.org/W1515157528","https://openalex.org/W1569146567","https://openalex.org/W1589600836","https://openalex.org/W1680189815","https://openalex.org/W1704721253","https://openalex.org/W1964011541","https://openalex.org/W1967786783","https://openalex.org/W1982525473","https://openalex.org/W1989289072","https://openalex.org/W2002272911","https://openalex.org/W2004660767","https://openalex.org/W2013198217","https://openalex.org/W2014369282","https://openalex.org/W2028081955","https://openalex.org/W2033885045","https://openalex.org/W2040194491","https://openalex.org/W2062459871","https://openalex.org/W2067050450","https://openalex.org/W2072291569","https://openalex.org/W2088768591","https://openalex.org/W2103981148","https://openalex.org/W2126307323","https://openalex.org/W2134422938","https://openalex.org/W2143996311","https://openalex.org/W2144407406","https://openalex.org/W2159759087","https://openalex.org/W2163656645","https://openalex.org/W2165956524","https://openalex.org/W2621717961","https://openalex.org/W2757107770","https://openalex.org/W3161056635"],"related_works":["https://openalex.org/W7024961501","https://openalex.org/W1971228003","https://openalex.org/W2158760370","https://openalex.org/W7095266495","https://openalex.org/W2028081955","https://openalex.org/W2343846702","https://openalex.org/W1504892637","https://openalex.org/W7096178708","https://openalex.org/W2020267722","https://openalex.org/W2126307323"],"abstract_inverted_index":{"A":[0,109,119],"separable":[1],"assignment":[2,78],"problem":[3,79,86],"(SAP)":[4],"is":[5,59,213,228],"defined":[6],"by":[7,217],"a":[8,13,22,33,45,83,93,103,162,180,198,214,232,238,257,276],"set":[9,14],"of":[10,15,48,50,72,102,138,200],"bins":[11,64],"and":[12,32,82,161,219,221,223,251],"items":[16,51,62],"to":[17,29,60,65,196],"pack":[18,61],"in":[19,54,89,175],"each":[20,38],"bin;":[21],"value,":[23],"fij,":[24],"for":[25,37,42,96,128,135,145,173,187,211,280],"assigning":[26],"item":[27],"j":[28],"bin":[30,39,43,55],"i;":[31],"separate":[34],"packing":[35,101],"constraint":[36],"\u2013":[40],"i.e.":[41],"i,":[44],"family":[46],"Ii":[47],"subsets":[49],"that":[52,140,249],"fit":[53],"i.":[56],"The":[57,205],"goal":[58],"into":[63],"maximize":[66],"the":[67,75,98,146,177,189,281],"aggregate":[68],"value.":[69],"This":[70],"class":[71],"problems":[73],"includes":[74],"maximum":[76],"generalized":[77],"(GAP)":[80],"1)":[81],"distributed":[84],"caching":[85],"(DCP)":[87],"described":[88],"this":[90],"paper.":[91],"Given":[92],"\u03b2-approximation":[94],"algorithm":[95,153,165,191,210,227,279],"finding":[97],"highest":[99],"value":[100],"single":[104],"bin,":[105],"we":[106,149,247],"give":[107,197],"1.":[108],"polynomial-time":[110,121,277],"LP-rounding":[111],"based":[112,229],"((1":[113],"\u2212":[114,133,156,159,202,262],"1":[115,157,168,201,203,215,261,263],"e)\u03b2)approximation":[116],"algorithm.":[117],"2.":[118],"simple":[120],"local":[122,163],"search":[123,164],"(":[124,167],"\u03b2":[125],"approximation":[126,143,183,209],"algorithm,":[127],"any":[129],"\u025b>":[130],"0.":[131],"\u03b2+1":[132],"\u025b)-Therefore,":[134],"all":[136],"examples":[137],"SAP":[139,250],"admit":[141],"an":[142,151],"scheme":[144,184],"single-bin":[147,282],"problem,":[148],"obtain":[150],"LPbased":[152],"with":[154,166,237],"(1":[155],"e":[158,264],"\u025b)-approximation":[160],"2":[169],"\u2212\u025b)-approximation":[170],"guarantee.":[171],"Furthermore,":[172],"cases":[174],"which":[176],"subproblem":[178],"admits":[179],"fully":[181],"polynomial":[182],"(such":[185],"as":[186],"GAP),":[188],"LP-based":[190],"analysis":[192],"can":[193],"be":[194,254],"strengthened":[195],"guarantee":[199],"e.":[204],"best":[206],"previously":[207],"known":[208],"GAP":[212],"2-approximation":[216],"Shmoys":[218],"Tardos;":[220],"Chekuri":[222],"Khanna.":[224],"Our":[225],"LP":[226],"on":[230],"rounding":[231],"new":[233],"linear":[234],"programming":[235],"relaxation,":[236],"provably":[239],"better":[240,259],"integrality":[241],"gap.":[242],"To":[243],"complement":[244],"these":[245],"results,":[246],"show":[248],"DCP":[252],"cannot":[253],"approximated":[255],"within":[256],"factor":[258],"than":[260],"unless":[265],"NP":[266],"\u2286":[267],"DTIME(n":[268],"O(log":[269],"log":[270],"n)),":[271],"even":[272],"if":[273],"there":[274],"exists":[275],"exact":[278],"problem.":[283]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}