iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1109/TPDS.2006.145
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:14:38Z","timestamp":1715591678534},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1109\/tpds.2006.145","type":"journal-article","created":{"date-parts":[[2006,9,8]],"date-time":"2006-09-08T17:40:22Z","timestamp":1157737222000},"page":"1151-1162","source":"Crossref","is-referenced-by-count":29,"title":["Replicated Server Placement with QoS Constraints"],"prefix":"10.1109","volume":"17","author":[{"given":"G.","family":"Rodolakis","sequence":"first","affiliation":[]},{"given":"S.","family":"Siachalou","sequence":"additional","affiliation":[]},{"given":"L.","family":"Georgiadis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"bibl115114","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory on NP-Completeness"},{"key":"bibl115115","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"key":"bibl115116","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/3-540-48777-8_8","article-title":"Improved Approximation Algorithms for Capacitated Facility Location Problems","author":"chudak","year":"1999","journal-title":"Proc Seventh Conf Integer Programming and Combinatorial Optimization"},{"key":"bibl115120","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959907"},{"key":"bibl115117","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1100"},{"key":"bibl115118","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380755"},{"key":"bibl115121","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703405754"},{"key":"bibl115119","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"bibl115122","doi-asserted-by":"publisher","DOI":"10.1002\/net.10080"},{"key":"bibl115123","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(03)00286-X"},{"key":"bibl115124","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00222-5"},{"key":"bibl115126","doi-asserted-by":"publisher","DOI":"10.1145\/950620.950621"},{"key":"bibl115125","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.1994.331794"},{"key":"bibl115128","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"bibl115127","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.145"},{"key":"bibl115111","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.1264807"},{"key":"bibl115129","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"bibl115110","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1356969"},{"key":"bibl115113","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633043"},{"key":"bibl115112","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.1278100"},{"key":"bibl11514","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/46.4.378"},{"key":"bibl11513","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/44.5.329"},{"key":"bibl11512","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752146"},{"key":"bibl11511","doi-asserted-by":"publisher","DOI":"10.1109\/90.879344"},{"key":"bibl11518","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916684"},{"key":"bibl115130","doi-asserted-by":"crossref","author":"de berg","year":"2000","journal-title":"Computational Geometry Algorithms and Applications","DOI":"10.1007\/978-3-662-04245-8"},{"key":"bibl115131","article-title":"BRITE: Universal Topology Generation from a User's Perspective","author":"medina","year":"2001"},{"key":"bibl11517","article-title":"SCAN: A Dynamic Scalable and Efficient Content Distribution Network","author":"chen","year":"2002","journal-title":"Proc First Int'l Conf Pervasive Computing"},{"key":"bibl11516","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-45748-8_29","article-title":"Dynamic Replica Placement for Scalable Content Delivery","author":"chen","year":"2002","journal-title":"Proc First Int'l Workshop Peer-to-Peer Systems"},{"key":"bibl11515","first-page":"1587","article-title":"On the Placement of Web Server Replicas","volume":"3","author":"qiu","year":"2001","journal-title":"Proc IEEE InfoCom"},{"key":"bibl11519","article-title":"Selection Algorithms for Replicated Web Servers","author":"sayal","year":"1998","journal-title":"Proc Workshop Internet Server Performance"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/71\/35606\/01687884.pdf?arnumber=1687884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:32:07Z","timestamp":1641987127000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1687884\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":31,"journal-issue":{"issue":"10"},"URL":"http:\/\/dx.doi.org\/10.1109\/tpds.2006.145","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}