{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:26:50Z","timestamp":1725888410766},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319600321"},{"type":"electronic","value":"9783319600338"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60033-8_51","type":"book-chapter","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T12:18:42Z","timestamp":1495801122000},"page":"593-604","source":"Crossref","is-referenced-by-count":2,"title":["Maximum-Weighted $$\\lambda $$ \u03bb -Colorable Subgraph: Revisiting and Applications"],"prefix":"10.1007","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaqiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xufei","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiliang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"key":"51_CR1","series-title":"Applied Optimization","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-1-4757-3613-7_23","volume-title":"Computational Methods in Decision-Making, Economics and Finance","author":"K Akcoglu","year":"2002","unstructured":"Akcoglu, K., Aspnes, J., DasGupta, B., Kao, M.-Y.: Opportunity cost algorithms for combinatorial auctions. In: Kontoghiorghes, E.J., Rustem, B., Siokos, S. (eds.) Computational Methods in Decision-Making, Economics and Finance. Applied Optimization, vol. 74, pp. 455\u2013479. Springer, Heidelberg (2002)"},{"key":"51_CR2","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48\u20135","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. JACM 48\u20135, 1069\u20131090 (2001)","journal-title":"JACM"},{"key":"51_CR3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31\u20132","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31\u20132, 331\u2013352 (2001)","journal-title":"SIAM J. Comput."},{"key":"51_CR4","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1137\/050625382","volume":"19","author":"R Bar-Yehuda","year":"2005","unstructured":"Bar-Yehuda, R., Rawttz, D.: On the equivalence between the primal-dual schema and the local ratio technique. SIAM J. Disc. Math. 19, 762\u2013797 (2005)","journal-title":"SIAM J. Disc. Math."},{"issue":"4","key":"51_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.disopt.2006.05.010","volume":"3","author":"R Bar-Yehuda","year":"2006","unstructured":"Bar-Yehuda, R., Rawttz, D.: Using fractional primal-dual to schedule split intervals with demands. J. Discret. Optim. 3(4), 275\u2013287 (2006)","journal-title":"J. Discret. Optim."},{"key":"51_CR6","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/0095-8956(80)90079-9","volume":"29","author":"A Frank","year":"1980","unstructured":"Frank, A.: On chain and antichain families of a partially ordered set. J. Comb. Theory Ser. B 29, 176\u2013184 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Joo, C., Lin, X., Shroff, N.B.: Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks. In: Proceedings of IEEE INFOCOM (2008)","DOI":"10.1109\/INFOCOM.2008.165"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Wan, P.-J.: Multiflows in multihop wireless networks. In: Proceedings of ACM MOBIHOC, pp. 85\u201394 (2009)","DOI":"10.1145\/1530748.1530761"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Jia, X., Dai, G., Du, H., Frieder, O.: Fast and simple approximation algorithms for maximum weighted independent set of links. In: IEEE INFOCOM, pp. 1653\u20131661 (2014)","DOI":"10.1109\/INFOCOM.2014.6848102"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Ma, C., Wang, Z., Xu, B., Li, M., Jia, X.: Weighted wireless link scheduling without information of positions and interference\/communication radii. In: Proceedings of IEEE INFOCOM (2011)","DOI":"10.1109\/INFCOM.2011.5935051"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Wang, L., Huang, A., Li, M., Yao, F.: Approximate capacity subregions of uniform multihop wireless networks. In: IEEE INFOCOM (2010)","DOI":"10.1109\/INFCOM.2010.5461904"},{"issue":"2","key":"51_CR12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","volume":"24","author":"M Yannakakis","year":"1987","unstructured":"Yannakakis, M., Gavril, F.: The maximum $$k$$ k -colorable subgraph problem for chordal graphs. Inf. Process. Lett. 24(2), 133\u2013137 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"51_CR13","first-page":"14:1","volume":"8","author":"Y Ye","year":"2012","unstructured":"Ye, Y., Borodin, A.: Elimination graphs. ACM Trans. Algorithms 8(2), 14:1\u201314:23 (2012)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60033-8_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T01:07:24Z","timestamp":1569373644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60033-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319600321","9783319600338"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60033-8_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}