{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T08:12:40Z","timestamp":1759565560969},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181955","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T15:35:00Z","timestamp":1056641700000},"source":"Crossref","is-referenced-by-count":20,"title":["Dependent rounding in bipartite graphs"],"prefix":"10.1109","author":[{"given":"R.","family":"Gandhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Khuller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959935"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"16","first-page":"265","article-title":"Approximation algorithms for facility location problems","author":"shmoys","year":"1997","journal-title":"Proc ACM Symp Theory of Computers"},{"key":"13","first-page":"290","article-title":"Scheduling broadcasts in wireless networks","author":"kalyanasundaram","year":"2000","journal-title":"Proc European Symposium of Algorithms LNCS 1879 Springer-Verlag"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700379760"},{"key":"11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/3-540-47867-1_30","article-title":"Algorithms for minimizing response time in broadcast scheduling","author":"gandhi","year":"2002","journal-title":"Proc Ninth Conference on Integer Programming and Combinatorial Optimization"},{"key":"12","first-page":"858","article-title":"Capacitated vertex covering with applications","author":"guha","year":"2002","journal-title":"Proc ACM-SIAM symposium on Discrete algorithms"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1497290.1497294"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335410"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038913.96607.c2"},{"key":"10","article-title":"Connected components in random graphs with given degree sequences","author":"graham","year":"0"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509970"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10084"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181972"},{"key":"4","first-page":"213","article-title":"A PTAS for the multiple knapsack problem","author":"chekuri","year":"2000","journal-title":"Proc ACM-SIAM symposium on Discrete algorithms"},{"key":"9","first-page":"194","article-title":"NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow","author":"erlebach","year":"2002","journal-title":"Proc 11th ACM-SIAM Ann Symp Discret Algorithms"},{"key":"8","year":"2002","journal-title":"DIMACS Workshop on Internet and WWW Measurement Mapping and Modeling"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","location":"Vancouver, BC, Canada","acronym":"SFCS-02"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181955.pdf?arnumber=1181955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:46:25Z","timestamp":1497566785000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181955\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181955","relation":{},"subject":[]}}