[{"conference":{"end_date":"2018-06-18","location":"Irvine, California, USA","name":"The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018)","start_date":"2018-06-18"},"_id":"2831","page":"5:1-5:6","year":"2018","type":"conference","citation":{"chicago":"Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.","apa":"Feldotto, M., Haake, C.-J., Skopalik, A., & Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018) (pp. 5:1-5:6). Irvine, California, USA. https://doi.org/10.1145/3230654.3230659","ama":"Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations Using the Shapley Value. In: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018). ; 2018:5:1-5:6. doi:10.1145/3230654.3230659","mla":"Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.","bibtex":"@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating User Evaluations Using the Shapley Value}, DOI={10.1145/3230654.3230659}, booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6} }","short":"M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.","ieee":"M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), Irvine, California, USA, 2018, pp. 5:1-5:6."},"user_id":"14052","ddc":["040"],"abstract":[{"lang":"eng","text":"We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete."}],"date_created":"2018-05-22T10:28:51Z","has_accepted_license":"1","status":"public","file":[{"creator":"nmaraun","file_id":"3910","file_size":1450171,"success":1,"relation":"main_file","date_updated":"2018-08-15T07:30:50Z","content_type":"application/pdf","file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf","date_created":"2018-08-15T07:30:50Z","access_level":"closed"}],"publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)","file_date_updated":"2018-08-15T07:30:50Z","author":[{"last_name":"Feldotto","id":"14052","first_name":"Matthias","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias"},{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake","id":"20801"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"},{"full_name":"Stroh-Maraun, Nadja","first_name":"Nadja","id":"13264","last_name":"Stroh-Maraun"}],"doi":"10.1145/3230654.3230659","date_updated":"2022-01-06T06:58:01Z","language":[{"iso":"eng"}],"title":"Disaggregating User Evaluations Using the Shapley Value","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"publication_status":"published","publication_identifier":{"isbn":["978-1-4503-5916-0"]},"department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}]},{"type":"journal_article","citation":{"chicago":"Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica 80, no. 5 (2018): 1556–1574. https://doi.org/10.1007/s00453-018-0420-y.","ama":"Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online Leasing Problems. . Algorithmica. 2018;80(5):1556–1574. doi:10.1007/s00453-018-0420-y","apa":"Li, S., Markarian, C., & Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . Algorithmica, 80(5), 1556–1574. https://doi.org/10.1007/s00453-018-0420-y","bibtex":"@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible Demands in Online Leasing Problems. }, volume={80}, DOI={10.1007/s00453-018-0420-y}, number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574} }","mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” Algorithmica, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:10.1007/s00453-018-0420-y.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.","ieee":"S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” Algorithmica, vol. 80, no. 5, pp. 1556–1574, 2018."},"year":"2018","page":"1556–1574","_id":"2848","intvolume":" 80","issue":"5","file":[{"file_size":600583,"file_id":"5298","creator":"ups","date_updated":"2018-11-02T15:18:16Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T15:18:16Z","file_name":"TowardsFlexibleDemandsInOnline.pdf","access_level":"closed"}],"author":[{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"id":"37612","last_name":"Markarian","full_name":"Markarian, Christine","first_name":"Christine"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"Springer","publication":"Algorithmica","file_date_updated":"2018-11-02T15:18:16Z","status":"public","has_accepted_license":"1","date_created":"2018-05-24T08:32:38Z","volume":80,"user_id":"477","ddc":["000"],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:58:06Z","doi":"10.1007/s00453-018-0420-y","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"title":"Towards Flexible Demands in Online Leasing Problems. "},{"language":[{"iso":"eng"}],"doi":"10.1007/s00224-017-9836-z","date_updated":"2022-01-06T06:58:06Z","publication_identifier":{"unknown":["1432-4350"]},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks","type":"journal_article","citation":{"bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}, DOI={10.1007/s00224-017-9836-z}, journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2018} }","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, Springer, 2018, doi:10.1007/s00224-017-9836-z.","chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” Theory of Computing Systems, 2018. https://doi.org/10.1007/s00224-017-9836-z.","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. https://doi.org/10.1007/s00224-017-9836-z","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. Theory of Computing Systems. 2018. doi:10.1007/s00224-017-9836-z","ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” Theory of Computing Systems, 2018.","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018)."},"year":"2018","_id":"2849","date_created":"2018-05-24T08:39:15Z","status":"public","has_accepted_license":"1","publication":"Theory of Computing Systems","file_date_updated":"2018-11-02T15:24:32Z","publisher":"Springer","author":[{"full_name":"Abu-Khzam, Faisal N. ","first_name":"Faisal N. ","last_name":"Abu-Khzam"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Schubert, Michael","first_name":"Michael","last_name":"Schubert"}],"file":[{"date_created":"2018-11-02T15:24:32Z","file_name":"ApproximationAndHeuristicAlgor.pdf","access_level":"closed","file_size":1371624,"file_id":"5301","creator":"ups","content_type":"application/pdf","date_updated":"2018-11-02T15:24:32Z","relation":"main_file","success":1}],"ddc":["000"],"user_id":"477"},{"_id":"2850","date_updated":"2022-01-06T06:58:07Z","doi":"10.4230/LIPIcs.FUN.2018.22","language":[{"iso":"eng"}],"type":"conference","citation":{"bibtex":"@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}, DOI={10.4230/LIPIcs.FUN.2018.22}, booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, year={2018} }","mla":"Hamann, Heiko, et al. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” Ninth International Conference on Fun with Algorithms (FUN), 2018, doi:10.4230/LIPIcs.FUN.2018.22.","ama":"Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: Ninth International Conference on Fun with Algorithms (FUN). ; 2018. doi:10.4230/LIPIcs.FUN.2018.22","apa":"Hamann, H., Markarian, C., Meyer auf der Heide, F., & Wahby, M. (2018). Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In Ninth International Conference on Fun with Algorithms (FUN). https://doi.org/10.4230/LIPIcs.FUN.2018.22","chicago":"Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” In Ninth International Conference on Fun with Algorithms (FUN), 2018. https://doi.org/10.4230/LIPIcs.FUN.2018.22.","ieee":"H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in Ninth International Conference on Fun with Algorithms (FUN), 2018.","short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018."},"year":"2018","user_id":"15415","ddc":["000"],"title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","file":[{"access_level":"closed","file_name":"LIPIcs-FUN-2018-22.pdf","date_created":"2018-11-13T13:15:19Z","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-11-13T13:15:19Z","creator":"feldi","file_id":"5536","file_size":554298}],"author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Mostafa","full_name":"Wahby, Mostafa","last_name":"Wahby"}],"publication":"Ninth International Conference on Fun with Algorithms (FUN)","department":[{"_id":"63"},{"_id":"238"}],"file_date_updated":"2018-11-13T13:15:19Z","status":"public","has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2018-05-24T08:41:48Z"},{"user_id":"15415","title":"An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest","place":"Cham","abstract":[{"lang":"eng","text":"We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \\(G=(V, E)\\) with \\(|V| = n\\) and node-weight function \\(w: V \\rightarrow \\mathcal {R}^+\\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \\(\\{s, t\\}\\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \\(\\mathcal {O}(\\log ^4 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \\(\\mathcal {O}(\\log n \\log k)\\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \\(\\varOmega (\\log ^2 n)\\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \\(\\mathcal {O}(\\log ^3 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \\(\\mathcal {O}(\\log n \\log ^2 k)\\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively."}],"status":"public","date_created":"2021-09-14T12:23:29Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian"}],"department":[{"_id":"63"}],"publication":"International Workshop on Combinatorial Algorithms (IWOCA)","doi":"10.1007/978-3-319-94667-2_18","date_updated":"2022-01-06T06:56:19Z","_id":"24396","language":[{"iso":"eng"}],"citation":{"ieee":"C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: 10.1007/978-3-319-94667-2_18.","short":"C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.","bibtex":"@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={10.1007/978-3-319-94667-2_18}, booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian, Christine}, year={2018} }","mla":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” International Workshop on Combinatorial Algorithms (IWOCA), 2018, doi:10.1007/978-3-319-94667-2_18.","chicago":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” In International Workshop on Combinatorial Algorithms (IWOCA). Cham, 2018. https://doi.org/10.1007/978-3-319-94667-2_18.","apa":"Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. International Workshop on Combinatorial Algorithms (IWOCA). https://doi.org/10.1007/978-3-319-94667-2_18","ama":"Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. In: International Workshop on Combinatorial Algorithms (IWOCA). ; 2018. doi:10.1007/978-3-319-94667-2_18"},"type":"conference","year":"2018"},{"project":[{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"title":"Scheduling with interjob communication on parallel processors","language":[{"iso":"eng"}],"doi":"10.1007/s10878-018-0325-3","date_updated":"2022-01-06T06:59:24Z","volume":36,"has_accepted_license":"1","status":"public","date_created":"2018-07-13T09:57:48Z","author":[{"last_name":"König","id":"22358","first_name":"Jürgen","full_name":"König, Jürgen"},{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"publication":"Journal of Combinatorial Optimization","file_date_updated":"2018-11-02T15:20:24Z","file":[{"date_updated":"2018-11-02T15:20:24Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":745708,"file_id":"5299","creator":"ups","access_level":"closed","file_name":"SchedulingWithInterjobCommunic.pdf","date_created":"2018-11-02T15:20:24Z"}],"ddc":["000"],"user_id":"477","type":"journal_article","citation":{"short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379.","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1356–1379, 2018.","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2018). Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization, 36(4), 1356–1379. https://doi.org/10.1007/s10878-018-0325-3","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. Journal of Combinatorial Optimization. 2018;36(4):1356-1379. doi:10.1007/s10878-018-0325-3","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1356–79. https://doi.org/10.1007/s10878-018-0325-3.","bibtex":"@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling with interjob communication on parallel processors}, volume={36}, DOI={10.1007/s10878-018-0325-3}, number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2018}, pages={1356–1379} }","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Journal of Combinatorial Optimization, vol. 36, no. 4, 2018, pp. 1356–79, doi:10.1007/s10878-018-0325-3."},"year":"2018","page":"1356-1379","issue":"4","intvolume":" 36","_id":"3551"},{"date_updated":"2022-01-06T06:59:45Z","_id":"3851","language":[{"iso":"ger"}],"supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"type":"bachelorsthesis","citation":{"ieee":"S. Koop, Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.","short":"S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn, 2018.","mla":"Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.","bibtex":"@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }","chicago":"Koop, Samuel. Congestion Games mit gewichteten Strategien. Universität Paderborn, 2018.","apa":"Koop, S. (2018). Congestion Games mit gewichteten Strategien. Universität Paderborn.","ama":"Koop S. Congestion Games mit gewichteten Strategien. Universität Paderborn; 2018."},"year":"2018","user_id":"14052","title":"Congestion Games mit gewichteten Strategien","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2018-08-08T11:56:37Z","publisher":"Universität Paderborn","author":[{"last_name":"Koop","first_name":"Samuel","full_name":"Koop, Samuel"}],"department":[{"_id":"541"},{"_id":"63"}]},{"_id":"17651","year":"2018","citation":{"ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in Combinatorial Optimization and Applications, 2018, pp. 217–232.","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232.","mla":"Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial Optimization and Applications, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and Applications}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim, Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232} }","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization and Applications. Cham: Springer International Publishing; 2018:217-232.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, & A. Zelikovsky (Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham: Springer International Publishing."},"type":"conference","page":"217-232","user_id":"83983","extern":"1","abstract":[{"lang":"eng","text":"Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\\$}{\\$}2 {\\backslash}sqrt{\\{} 2{\\backslash}left| E {\\backslash}right| {\\}}{\\$}{\\$}and {\\$}{\\$}2 {\\backslash}sqrt{\\{}2 ({\\backslash}left| E {\\backslash}right| + {\\backslash}left| {\\backslash}text {\\{}undesirable flows{\\}} {\\backslash}right| ){\\}}{\\$}{\\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming."}],"status":"public","date_created":"2020-08-06T15:19:36Z","author":[{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"Trajanovski","full_name":"Trajanovski, Stojan","first_name":"Stojan"},{"last_name":"Grosso","first_name":"Paola","full_name":"Grosso, Paola"},{"first_name":"Cees","full_name":"de Laat, Cees","last_name":"de Laat"}],"publisher":"Springer International Publishing","publication":"Combinatorial Optimization and Applications","keyword":["flow","Red-Blue Set Cover","Positive-Negative Partial Set Cover","approximation","tree","MAX SNP-hard","root","leaf","dynamic programming","FPT"],"date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"title":"Removing Undesirable Flows by Edge Deletion","place":"Cham","editor":[{"last_name":"Kim","first_name":"Donghyun","full_name":"Kim, Donghyun"},{"first_name":"R. N.","full_name":"Uma, R. N.","last_name":"Uma"},{"last_name":"Zelikovsky","first_name":"Alexander","full_name":"Zelikovsky, Alexander"}],"publication_identifier":{"isbn":["978-3-030-04651-4"]},"department":[{"_id":"63"},{"_id":"541"}]},{"year":"2018","type":"journal_article","citation":{"ieee":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, and P. Grosso, “Measuring the efficiency of SDN mitigations against attacks on computer infrastructures,” Future Generation Computer Systems, 2018.","short":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018).","bibtex":"@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}, DOI={https://doi.org/10.1016/j.future.2018.08.011}, journal={Future Generation Computer Systems}, author={Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}, year={2018} }","mla":"Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” Future Generation Computer Systems, 2018, doi:https://doi.org/10.1016/j.future.2018.08.011.","apa":"Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., & Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2018.08.011","ama":"Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. Future Generation Computer Systems. 2018. doi:https://doi.org/10.1016/j.future.2018.08.011","chicago":"Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” Future Generation Computer Systems, 2018. https://doi.org/10.1016/j.future.2018.08.011."},"language":[{"iso":"eng"}],"doi":"https://doi.org/10.1016/j.future.2018.08.011","date_updated":"2022-01-06T06:53:16Z","_id":"17666","publication_identifier":{"issn":["0167-739X"]},"date_created":"2020-08-06T15:23:11Z","status":"public","keyword":["Software defined networks","Network function virtualization","Cyber attacks","Cyber security","Defense efficiency","Overlay networks"],"department":[{"_id":"63"},{"_id":"541"}],"publication":"Future Generation Computer Systems","author":[{"last_name":"Koning","full_name":"Koning, R.","first_name":"R."},{"last_name":"de Graaff","full_name":"de Graaff, B.","first_name":"B."},{"last_name":"Polevoy","id":"83983","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"last_name":"Meijer","first_name":"R.","full_name":"Meijer, R."},{"full_name":"de Laat, C.","first_name":"C.","last_name":"de Laat"},{"full_name":"Grosso, P.","first_name":"P.","last_name":"Grosso"}],"title":"Measuring the efficiency of SDN mitigations against attacks on computer infrastructures","user_id":"83983","extern":"1","abstract":[{"text":"Software Defined Networks (SDN) and Network Function Virtualisation (NFV) provide the basis for autonomous response and mitigation against attacks on networked computer infrastructures. We propose a new framework that uses SDNs and NFV to achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an agent running a control loop constantly assesses the security state of the network by means of observables. The agent reacts to and resolves security problems, while learning from its previous decisions. Two main metrics govern the decision process in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate countermeasures and are the building blocks for self-learning SARNETs that exhibit autonomous response. In this paper we present the software implementation of the SARNET framework, evaluate it in a real-life network and discuss the tradeoffs between parameters used by the SARNET agent and the efficiency of its actions.","lang":"eng"}]},{"file_date_updated":"2018-03-21T13:16:59Z","publication":"Journal of Scheduling","author":[{"last_name":"Althaus","full_name":"Althaus, Ernst","first_name":"Ernst"},{"first_name":"Andre","full_name":"Brinkmann, Andre","last_name":"Brinkmann"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Nagel","full_name":"Nagel, Lars","first_name":"Lars"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"full_name":"Sgall, Jiri","first_name":"Jiri","last_name":"Sgall"},{"full_name":"Suess, Tim","first_name":"Tim","last_name":"Suess"}],"publisher":"Springer","file":[{"access_level":"closed","date_created":"2018-03-21T13:16:59Z","file_name":"63-main_05.pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T13:16:59Z","content_type":"application/pdf","file_id":"1577","creator":"florida","file_size":466808}],"volume":21,"date_created":"2017-10-17T12:41:03Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15415","page":"77-92","year":"2018","type":"journal_article","citation":{"ieee":"E. Althaus et al., “Scheduling Shared Continuous Resources on Many-Cores,” Journal of Scheduling, vol. 21, no. 1, pp. 77–92, 2018, doi: 10.1007/s10951-017-0518-0.","short":"E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.","mla":"Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:10.1007/s10951-017-0518-0.","bibtex":"@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018, title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={10.1007/s10951-017-0518-0}, number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018}, pages={77–92} }","chicago":"Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.” Journal of Scheduling 21, no. 1 (2018): 77–92. https://doi.org/10.1007/s10951-017-0518-0.","apa":"Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., Sgall, J., & Suess, T. (2018). Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling, 21(1), 77–92. https://doi.org/10.1007/s10951-017-0518-0","ama":"Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources on Many-Cores. Journal of Scheduling. 2018;21(1):77-92. doi:10.1007/s10951-017-0518-0"},"intvolume":" 21","_id":"63","issue":"1","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"title":"Scheduling Shared Continuous Resources on Many-Cores","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:00Z","doi":"10.1007/s10951-017-0518-0"}]