{"id":"https://openalex.org/W2144416612","doi":"https://doi.org/10.1109/sfcs.2002.1181955","title":"Dependent rounding in bipartite graphs","display_name":"Dependent rounding in bipartite graphs","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2144416612","doi":"https://doi.org/10.1109/sfcs.2002.1181955","mag":"2144416612"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181955","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/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":"R. Gandhi","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, USA","Dept. of Computer Sci., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Computer Sci., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"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":"S. Khuller","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, USA","Dept. of Computer Sci., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Computer Sci., Maryland Univ., College Park, MD, USA","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":"S. Parthasarathy","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, USA","Dept. of Computer Sci., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Computer Sci., Maryland Univ., College Park, MD, USA","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":"A. Srinivasan","raw_affiliation_strings":["Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, USA","Dept. of Computer Sci., Maryland Univ., College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Dept. of Computer Sci., Maryland Univ., College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":9.9007,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.98795297,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/rounding","display_name":"Rounding","score":0.8508052825927734},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8322687149047852},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.6156314015388489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5234783887863159},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4576612114906311},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45104220509529114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34649574756622314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33363932371139526},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.331506609916687},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3073556125164032},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.25191664695739746},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18354946374893188}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8508052825927734},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8322687149047852},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.6156314015388489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5234783887863159},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4576612114906311},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45104220509529114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34649574756622314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33363932371139526},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.331506609916687},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3073556125164032},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.25191664695739746},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18354946374893188},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2002.1181955","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181955","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.1523","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.1523","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/depRound.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.5880","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~samir/grant/focs02.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1546806723","https://openalex.org/W1966544820","https://openalex.org/W1984137208","https://openalex.org/W1994636110","https://openalex.org/W1996696855","https://openalex.org/W2002658910","https://openalex.org/W2003902046","https://openalex.org/W2013198217","https://openalex.org/W2020636116","https://openalex.org/W2044191411","https://openalex.org/W2049033541","https://openalex.org/W2072291569","https://openalex.org/W2076746184","https://openalex.org/W2089074354","https://openalex.org/W2102201348","https://openalex.org/W2108073487","https://openalex.org/W2144407406","https://openalex.org/W3148765228","https://openalex.org/W6637972486","https://openalex.org/W6649072020","https://openalex.org/W6653593260","https://openalex.org/W6672819393","https://openalex.org/W6682343373"],"related_works":["https://openalex.org/W1555816812","https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2036057584","https://openalex.org/W3166231268","https://openalex.org/W3042669702","https://openalex.org/W4294294408","https://openalex.org/W2913147187","https://openalex.org/W3037054849","https://openalex.org/W2033371793"],"abstract_inverted_index":{"We":[0,36],"combine":[1],"the":[2,31,49],"pipage":[3],"rounding":[4,13,24],"technique":[5,43],"of":[6,33,40,82,91],"Ageev":[7],"&":[8],"Sviridenko":[9],"with":[10,44,57],"a":[11,21,58],"recent":[12],"method":[14,93],"developed":[15],"by":[16],"Srinivasan":[17],"(2001),":[18],"to":[19,48],"develop":[20],"new":[22],"randomized":[23],"approach":[25],"for":[26,55],"fractional":[27],"vectors":[28],"defined":[29],"on":[30,84],"edge-sets":[32],"bipartite":[34],"graphs.":[35],"show":[37],"various":[38],"ways":[39],"combining":[41],"this":[42],"other":[45],"ideas,":[46],"leading":[47],"following":[50],"applications:":[51],"richer":[52],"random-graph":[53],"models":[54],"graphs":[56],"given":[59],"degree-sequence;":[60],"improved":[61],"approximation":[62],"algorithms":[63],"for:":[64],"(i)":[65],"throughput-maximization":[66],"in":[67,72],"broadcast":[68,73],"scheduling,":[69,74],"(ii)":[70],"delay-minimization":[71],"and":[75],"(iii)":[76],"capacitated":[77],"vertex":[78],"cover;":[79],"fair":[80],"scheduling":[81],"jobs":[83],"unrelated":[85],"parallel":[86],"machines.":[87],"A":[88],"useful":[89],"feature":[90],"our":[92],"is":[94],"that":[95],"it":[96],"lets":[97],"us":[98],"prove":[99],"certain":[100],"(probabilistic)":[101],"per-user":[102],"fairness":[103],"properties.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}