{"id":"https://openalex.org/W2007604989","doi":"https://doi.org/10.1145/1147954.1147956","title":"Dependent rounding and its applications to approximation algorithms","display_name":"Dependent rounding and its applications to approximation algorithms","publication_year":2006,"publication_date":"2006-05-01","ids":{"openalex":"https://openalex.org/W2007604989","doi":"https://doi.org/10.1145/1147954.1147956","mag":"2007604989"},"language":"en","primary_location":{"id":"doi:10.1145/1147954.1147956","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1147954.1147956","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5015765462","display_name":"Rajiv Gandhi","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajiv Gandhi","raw_affiliation_strings":["Rutgers University, Camden, New Jersey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Camden, New Jersey","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["University of Maryland, College Park, Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100755351","display_name":"Srinivasan Parthasarathy","orcid":"https://orcid.org/0000-0002-6062-6449"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivasan Parthasarathy","raw_affiliation_strings":["University of Maryland, College Park, Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, College Park, Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, Maryland","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.8725,"has_fulltext":false,"cited_by_count":296,"citation_normalized_percentile":{"value":0.97899276,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"53","issue":"3","first_page":"324","last_page":"360"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/randomized-rounding","display_name":"Randomized rounding","score":0.8634908199310303},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7952743768692017},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6644299626350403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6489896774291992},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.643256664276123},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.556658923625946},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5366356372833252},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.48650282621383667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4348889887332916},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.43263566493988037},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3955315351486206},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31879448890686035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3064672350883484},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2968656122684479}],"concepts":[{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.8634908199310303},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7952743768692017},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6644299626350403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6489896774291992},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.643256664276123},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.556658923625946},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5366356372833252},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.48650282621383667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4348889887332916},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.43263566493988037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3955315351486206},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31879448890686035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3064672350883484},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2968656122684479},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1147954.1147956","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1147954.1147956","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.120.2432","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.2432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~rajivg/publications/journal/jacm06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1558145674","https://openalex.org/W1572000546","https://openalex.org/W1591562949","https://openalex.org/W1597777163","https://openalex.org/W1769679476","https://openalex.org/W1965193466","https://openalex.org/W1965765215","https://openalex.org/W1972652674","https://openalex.org/W1976969221","https://openalex.org/W1984137208","https://openalex.org/W2003902046","https://openalex.org/W2004943036","https://openalex.org/W2013198217","https://openalex.org/W2014369282","https://openalex.org/W2019306084","https://openalex.org/W2020636116","https://openalex.org/W2022191808","https://openalex.org/W2038550366","https://openalex.org/W2051169745","https://openalex.org/W2058267344","https://openalex.org/W2066826444","https://openalex.org/W2067103503","https://openalex.org/W2072291569","https://openalex.org/W2075734492","https://openalex.org/W2089074354","https://openalex.org/W2102201348","https://openalex.org/W2108073487","https://openalex.org/W2112976607","https://openalex.org/W2134373906","https://openalex.org/W2139708889","https://openalex.org/W2141860966","https://openalex.org/W2144407406","https://openalex.org/W2144416612","https://openalex.org/W2296125569","https://openalex.org/W2340365916","https://openalex.org/W3138033350","https://openalex.org/W3157604873","https://openalex.org/W6667365195","https://openalex.org/W6703962106"],"related_works":["https://openalex.org/W1581948717","https://openalex.org/W2268207117","https://openalex.org/W4300488607","https://openalex.org/W2951095575","https://openalex.org/W1916943706","https://openalex.org/W2002272911","https://openalex.org/W2099734427","https://openalex.org/W2543175834","https://openalex.org/W4293997817","https://openalex.org/W4388968519"],"abstract_inverted_index":{"We":[0,17],"develop":[1],"a":[2,46],"new":[3],"randomized":[4],"rounding":[5],"approach":[6],"for":[7,33,43],"fractional":[8],"vectors":[9],"defined":[10],"on":[11,73],"the":[12],"edge-sets":[13],"of":[14,21,71],"bipartite":[15],"graphs.":[16],"show":[18],"various":[19,34],"ways":[20],"combining":[22],"this":[23],"technique":[24],"with":[25,45],"other":[26],"ideas,":[27],"leading":[28],"to":[29],"improved":[30],"(approximation)":[31],"algorithms":[32,50],"problems.":[35],"These":[36],"include:---low":[37],"congestion":[38],"multi-path":[39],"routing;---richer":[40],"random-graph":[41],"models":[42],"graphs":[44],"given":[47],"degree-sequence;---improved":[48],"approximation":[49],"for:":[51],"(i)":[52],"throughput-maximization":[53],"in":[54,59],"broadcast":[55,60],"scheduling,":[56,61],"(ii)":[57],"delay-minimization":[58],"as":[62,64],"well":[63],"(iii)":[65],"capacitated":[66],"vertex":[67],"cover;":[68],"and---fair":[69],"scheduling":[70],"jobs":[72],"unrelated":[74],"parallel":[75],"machines.":[76]},"counts_by_year":[{"year":2026,"cited_by_count":15},{"year":2025,"cited_by_count":20},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":26},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":12}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}