{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:26:19Z","timestamp":1743117979764,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031754081"},{"type":"electronic","value":"9783031754098"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_12","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:42Z","timestamp":1737497442000},"page":"166-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximations and\u00a0Hardness of\u00a0Covering and\u00a0Packing Partially Ordered Items"],"prefix":"10.1007","author":[{"given":"Ilan","family":"Doron-Arad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Biondi, M., Saliba, S., Harjunkoski, I.: Production optimization and scheduling in a steel plant: hot rolling mill. In: 18th World Congress of the International Federation of Automatic Control, pp. 11750\u201311754 (2011)","DOI":"10.3182\/20110828-6-IT-1002.01157"},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.dam.2009.09.010","volume":"158","author":"P Bonsma","year":"2010","unstructured":"Bonsma, P.: Most balanced minimum cuts. Discret. Appl. Math. 158(4), 261\u2013276 (2010)","journal-title":"Discret. Appl. Math."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.jda.2012.04.011","volume":"16","author":"G Borradaile","year":"2012","unstructured":"Borradaile, G., Heeringa, B., Wilfong, G.: The knapsack problem with neighbour constraints. J. Discret. Algorithms 16, 224\u2013235 (2012)","journal-title":"J. Discret. Algorithms"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, T., Wang, K., Wang, L.C., Lee, C.W.: An in-switch rule caching and replacement algorithm in software defined networks. In: 2018 IEEE International Conference on Communications (ICC), pp.\u00a01\u20136. IEEE (2018)","DOI":"10.1109\/ICC.2018.8422992"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1137\/16M1096402","volume":"32","author":"E Chlamt\u00e1c","year":"2018","unstructured":"Chlamt\u00e1c, E., Dinitz, M., Konrad, C., Kortsarz, G., Rabanca, G.: The densest k-subhypergraph problem. SIAM J. Discret. Math. 32(2), 1458\u20131477 (2018)","journal-title":"SIAM J. Discret. Math."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Chlamt\u00e1\u010d, E., Dinitz, M., Makarychev, Y.: Minimizing the union: tight approximations for small set bipartite vertex expansion. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 881\u2013899 (2017)","DOI":"10.1137\/1.9781611974782.56"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/MNET.2015.7166189","volume":"29","author":"M Dong","year":"2015","unstructured":"Dong, M., Li, H., Ota, K., Xiao, J.: Rule caching in SDN-enabled mobile access networks. IEEE Netw. 29(4), 40\u201345 (2015)","journal-title":"IEEE Netw."},{"key":"12_CR8","unstructured":"Doron-Arad, I., Kortsarz, G., Naor, J., Schieber, B., Shachnai, H.: Approximations and hardness of packing partially ordered items. arXiv preprint arXiv:2403.01568 (2024)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Gamage, S., Pasqual, A.: High-performance parallel packet classification architecture with popular rule caching. In: 2012 18th IEEE International Conference on Networks (ICON), pp. 52\u201357. IEEE (2012)","DOI":"10.1109\/ICON.2012.6506533"},{"key":"12_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.107844","volume":"188","author":"P Gao","year":"2021","unstructured":"Gao, P., Xu, Y., Chao, H.J.: OVS-cab: efficient rule-caching for open vswitch hardware offloading. Comput. Netw. 188, 107844 (2021)","journal-title":"Comput. Netw."},{"key":"12_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"12_CR12","unstructured":"Hajiaghayi, M., et al.: The minimum k-colored subgraph problem in haplotyping and DNA primer selection. In: Proceedings of the International Workshop on Bioinformatics Research and Applications (IWBRA), pp. 1\u201312 (2006)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Hoberg, R., Rothvoss, T.: A logarithmic additive integrality gap for bin packing. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2616\u20132625 (2017)","DOI":"10.1137\/1.9781611974782.172"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/TPDS.2015.2431684","volume":"27","author":"H Huang","year":"2015","unstructured":"Huang, H., Guo, S., Li, P., Liang, W., Zomaya, A.Y.: Cost minimization for rule caching in software defined networking. IEEE Trans. Parallel Distrib. Syst. 27(4), 1007\u20131016 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Li, H., Guo, S., Wu, C., Li, J.: FDRC: flow-driven rule caching optimization in software defined networking. In: 2015 IEEE International Conference on Communications (ICC), pp. 5777\u20135782. IEEE (2015)","DOI":"10.1109\/ICC.2015.7249243"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Li, R., Pang, Y., Zhao, J., Wang, X.: A tale of two (flow) tables: demystifying rule caching in openflow switches. In: Proceedings of the 48th International Conference on Parallel Processing, pp. 1\u201310 (2019)","DOI":"10.1145\/3337821.3337896"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Li, R., Zhao, B., Chen, R., Zhao, J.: Taming the wildcards: towards dependency-free rule caching with freecache. In: 2020 IEEE\/ACM 28th International Symposium on Quality of Service (IWQoS), pp. 1\u201310. IEEE (2020)","DOI":"10.1109\/IWQoS49365.2020.9212969"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Manurangsi, P.: Inapproximability of maximum edge biclique, maximum balanced biclique and minimum k-cut from the small set expansion hypothesis. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) (2017)","DOI":"10.3390\/a11010010"},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1111\/itor.12381","volume":"25","author":"U Pferschy","year":"2018","unstructured":"Pferschy, U., Scatamacchia, R.: Improved dynamic programming and approximation results for the knapsack problem with setups. Int. Trans. Oper. Res. 25(2), 667\u2013682 (2018)","journal-title":"Int. Trans. Oper. Res."},{"issue":"9","key":"12_CR20","doi-asserted-by":"publisher","first-page":"8917","DOI":"10.1109\/JIOT.2020.3000393","volume":"7","author":"SH Rastegar","year":"2020","unstructured":"Rastegar, S.H., Abbasfar, A., Shah-Mansouri, V.: Rule caching in SDN-enabled base stations supporting massive IoT devices with bursty traffic. IEEE Internet Things J. 7(9), 8917\u20138931 (2020)","journal-title":"IEEE Internet Things J."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Rottenstreich, O., Kulik, A., Joshi, A., Rexford, J., R\u00e9tv\u00e1ri, G., Menasch\u00e9, D.S.: Cooperative rule caching for SDN switches. In: 9th International Conference on Cloud Networking (CloudNet), pp.\u00a01\u20137 (2020)","DOI":"10.1109\/CloudNet51028.2020.9335795"},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1109\/TNET.2016.2611482","volume":"25","author":"O Rottenstreich","year":"2016","unstructured":"Rottenstreich, O., Tapolcai, J.: Optimal rule caching and lossy compression for longest prefix matching. IEEE\/ACM Trans. Netw. 25(2), 864\u2013878 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TNSM.2016.2530687","volume":"13","author":"JP Sheu","year":"2016","unstructured":"Sheu, J.P., Chuo, Y.C.: Wildcard rules caching and cache replacement algorithms in software-defined networking. IEEE Trans. Netw. Serv. Manag. 13(1), 19\u201329 (2016)","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/93605.98737","volume":"19","author":"M Stonebraker","year":"1990","unstructured":"Stonebraker, M., Jhingran, A., Goh, J., Potamianos, S.: On rules, procedure, caching and views in data base systems. ACM SIGMOD Rec. 19(2), 281\u2013290 (1990)","journal-title":"ACM SIGMOD Rec."},{"key":"12_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108636","volume":"173","author":"YZ Wang","year":"2022","unstructured":"Wang, Y.Z., Zheng, Z., Zhu, M.M., Zhang, K.T., Gao, X.Q.: An integrated production batch planning approach for steelmaking-continuous casting with cast batching plan as the core. Comput. Ind. Eng. 173, 108636 (2022)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/TNET.2018.2815983","volume":"26","author":"B Yan","year":"2018","unstructured":"Yan, B., Xu, Y., Chao, H.J.: Adaptive wildcard rule cache management for software-defined networks. IEEE\/ACM Trans. Netw. 26(2), 962\u2013975 (2018)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Yan, B., Xu, Y., Xing, H., Xi, K., Chao, H.J.: Cab: a reactive wildcard rule caching system for software-defined networks. In: Proceedings of the 3rd Workshop on Hot Topics in Software Defined Networking, pp. 163\u2013168 (2014)","DOI":"10.1145\/2620728.2620732"},{"issue":"6","key":"12_CR28","doi-asserted-by":"publisher","first-page":"999","DOI":"10.3390\/electronics9060999","volume":"9","author":"J Yang","year":"2020","unstructured":"Yang, J., Li, T., Yan, J., Li, J., Li, C., Wang, B.: Pipecache: high hit rate rule-caching scheme based on multi-stage cache tables. Electronics 9(6), 999 (2020)","journal-title":"Electronics"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.compbiomed.2009.05.005","volume":"39","author":"Y Ye","year":"2009","unstructured":"Ye, Y., Jiang, Z., Diao, X., Yang, D., Du, G.: An ontology-based hierarchical semantic modeling approach to clinical pathway workflows. Comput. Biologyand Med. 39, 722\u2013732 (2009)","journal-title":"Comput. Biologyand Med."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:49Z","timestamp":1737497449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}