--- _id: '17653' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: M.M. full_name: de Weerdt, M.M. last_name: de Weerdt citation: ama: 'Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.' apa: Polevoy, G., & de Weerdt, M. M. (2017). Reciprocation Effort Games. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer. bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }' chicago: Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017. ieee: G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017. mla: Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017. short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.' date_created: 2020-08-06T15:20:09Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - interaction - reciprocation - contribute - shared effort - curbing - convergence - threshold - Nash equilibrium - social welfare - efficiency - price of anarchy - price of stability language: - iso: eng publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence publisher: Springer series_title: CCIS status: public title: Reciprocation Effort Games type: conference user_id: '83983' year: '2017' ... --- _id: '17654' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: M.M. full_name: de Weerdt, M.M. last_name: de Weerdt citation: ama: 'Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.' apa: Polevoy, G., & de Weerdt, M. M. (2017). Competition between Cooperative Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer. bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }' chicago: Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017. ieee: G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017. mla: Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017. short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.' date_created: 2020-08-06T15:20:19Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - agents - projects - contribute - shared effort game - competition - quota - threshold - Nash equilibrium - social welfare - efficiency - price of anarchy - price of stability language: - iso: eng publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence publisher: Springer series_title: CCIS status: public title: Competition between Cooperative Projects type: conference user_id: '83983' year: '2017' ... --- _id: '17811' abstract: - lang: eng text: "We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional grid. A basic task for such a swarm is the gathering process: All\r\nrobots have to gather at one (not predefined) place. A common local model for\r\nextremely simple robots is the following: The robots do not have a common\r\ncompass, only have a constant viewing radius, are autonomous and\r\nindistinguishable, can move at most a constant distance in each step, cannot\r\ncommunicate, are oblivious and do not have flags or states. The only gathering\r\nalgorithm under this robot model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same time and a similar local model additionally require a\r\nconstant memory, states and \"flags\" to communicate these states to neighbors in\r\nviewing range. They gather in time $\\mathcal{O}(n)$.\r\n In this paper we contribute the (to the best of our knowledge) first\r\ngathering algorithm on the grid that works under the same simple local model as\r\nthe above mentioned Euclidean plane strategy, i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$ time model. This time bound\r\nmatches the time bound of the best known algorithm for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such configurations cannot be\r\nsolved." author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. arXiv:170203400. 2017. apa: Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. ArXiv:1702.03400. bibtex: '@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous, Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }' chicago: Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017. ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” arXiv:1702.03400. 2017. mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017. short: M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017). date_created: 2020-08-11T13:48:38Z date_updated: 2022-01-06T06:53:20Z department: - _id: '63' language: - iso: eng publication: arXiv:1702.03400 status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: preprint user_id: '15415' year: '2017' ... --- _id: '79' abstract: - lang: eng text: Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\Theta(\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\sigma^{-2} \log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\Omega(\sqrt{n})$-bound. author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA). Vol 10787. Lecture Notes in Computer Science. Springer; 2017:207-222. doi:10.1007/978-3-319-89441-6' apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (Vol. 10787, pp. 207–222). Springer. https://doi.org/10.1007/978-3-319-89441-6 bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times}, volume={10787}, DOI={10.1007/978-3-319-89441-6}, booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222}, collection={Lecture Notes in Computer Science} }' chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 10787:207–22. Lecture Notes in Computer Science. Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6. ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, vol. 10787, pp. 207–222. mla: Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), vol. 10787, Springer, 2017, pp. 207–22, doi:10.1007/978-3-319-89441-6. short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 207–222.' date_created: 2017-10-17T12:41:06Z date_updated: 2022-01-06T07:03:47Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-89441-6 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:59:22Z date_updated: 2018-11-02T14:59:22Z file_id: '5289' file_name: Non-clairvoyantSchedulingToMin.pdf file_size: 380629 relation: main_file success: 1 file_date_updated: 2018-11-02T14:59:22Z has_accepted_license: '1' intvolume: ' 10787' language: - iso: eng page: 207-222 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times type: conference user_id: '477' volume: 10787 year: '2017' ... --- _id: '82' abstract: - lang: eng text: Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter. author: - first_name: Faisal N. full_name: Abu-Khzam, Faisal N. last_name: Abu-Khzam - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW). LNCS. ; 2017:139-150. doi:10.1007/978-3-319-59605-1_13' apa: 'Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) (pp. 139–150). https://doi.org/10.1007/978-3-319-59605-1_13' bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2017, series={LNCS}, title={Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}, DOI={10.1007/978-3-319-59605-1_13}, booktitle={Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2017}, pages={139–150}, collection={LNCS} }' chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” In Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 139–50. LNCS, 2017. https://doi.org/10.1007/978-3-319-59605-1_13.' ieee: 'F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,” in Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.' mla: 'Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–50, doi:10.1007/978-3-319-59605-1_13.' short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.' date_created: 2017-10-17T12:41:07Z date_updated: 2022-01-06T07:03:52Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-59605-1_13 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:07:35Z date_updated: 2018-11-02T15:07:35Z file_id: '5294' file_name: Modular-WidthAnAuxiliaryParame.pdf file_size: 238276 relation: main_file success: 1 file_date_updated: 2018-11-02T15:07:35Z has_accepted_license: '1' language: - iso: eng page: 139-150 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW) series_title: LNCS status: public title: 'Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity' type: conference user_id: '477' year: '2017' ... --- _id: '59' abstract: - lang: eng text: We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed). author: - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2017:123--132. doi:10.1145/3087556.3087578' apa: 'Kling, P., Mäcker, A., Riechers, S., & Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 123--132). https://doi.org/10.1145/3087556.3087578' bibtex: '@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}, DOI={10.1145/3087556.3087578}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }' chicago: 'Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017. https://doi.org/10.1145/3087556.3087578.' ieee: 'P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.' mla: 'Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578.' short: 'P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.' date_created: 2017-10-17T12:41:02Z date_updated: 2022-01-06T07:02:46Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1145/3087556.3087578 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:17:33Z date_updated: 2018-03-21T13:17:33Z file_id: '1578' file_name: 59-progress.pdf file_size: 784867 relation: main_file success: 1 file_date_updated: 2018-03-21T13:17:33Z has_accepted_license: '1' language: - iso: eng page: 123--132 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: 'Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource' type: conference user_id: '477' year: '2017' ... --- _id: '70' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online Leasing. In: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA). ; 2017:17-31. doi:10.1007/978-3-319-71147-8_2' apa: Feldkord, B., Markarian, C., & Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 17–31). https://doi.org/10.1007/978-3-319-71147-8_2 bibtex: '@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price Fluctuations in Online Leasing}, DOI={10.1007/978-3-319-71147-8_2}, booktitle={Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }' chicago: Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.” In Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 17–31, 2017. https://doi.org/10.1007/978-3-319-71147-8_2. ieee: B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31. mla: Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31, doi:10.1007/978-3-319-71147-8_2. short: 'B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.' date_created: 2017-10-17T12:41:05Z date_updated: 2022-01-06T07:03:26Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-71147-8_2 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:06:13Z date_updated: 2018-11-02T15:06:13Z file_id: '5293' file_name: PriceFluctuationInOnlineLeasin.pdf file_size: 287315 relation: main_file success: 1 file_date_updated: 2018-11-02T15:06:13Z has_accepted_license: '1' language: - iso: eng page: 17 - 31 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA) status: public title: Price Fluctuations in Online Leasing type: conference user_id: '477' year: '2017' ... --- _id: '703' author: - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: ama: Podlipyan P. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-230 apa: Podlipyan, P. (2017). Local Algorithms for the Continuous Gathering Problem. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-230 bibtex: '@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering Problem}, DOI={10.17619/UNIPB/1-230}, publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }' chicago: Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-230. ieee: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017. mla: Podlipyan, Pavel. Local Algorithms for the Continuous Gathering Problem. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-230. short: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017. date_created: 2017-11-14T14:13:21Z date_updated: 2022-01-06T07:03:26Z department: - _id: '63' doi: 10.17619/UNIPB/1-230 language: - iso: eng publisher: Universität Paderborn related_material: link: - relation: confirmation url: https://doi.org/10.17619/UNIPB/1-230 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Local Algorithms for the Continuous Gathering Problem type: dissertation user_id: '15415' year: '2017' ... --- _id: '704' author: - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: Riechers S. Scheduling with Scarce Resources. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-231 apa: Riechers, S. (2017). Scheduling with Scarce Resources. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-231 bibtex: '@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={10.17619/UNIPB/1-231}, publisher={Universität Paderborn}, author={Riechers, Sören}, year={2017} }' chicago: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-231. ieee: S. Riechers, Scheduling with Scarce Resources. Universität Paderborn, 2017. mla: Riechers, Sören. Scheduling with Scarce Resources. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-231. short: S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017. date_created: 2017-11-15T07:51:07Z date_updated: 2022-01-06T07:03:27Z ddc: - '000' department: - _id: '63' doi: 10.17619/UNIPB/1-231 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-11-14T15:18:37Z date_updated: 2018-11-14T15:18:37Z file_id: '5673' file_name: thesisStable.pdf file_size: 1491627 relation: main_file success: 1 file_date_updated: 2018-11-14T15:18:37Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Scheduling with Scarce Resources type: dissertation user_id: '14052' year: '2017' ... --- _id: '706' author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization. 2017;36(4):1168-1194. doi:10.1007/s10878-017-0198-x apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. Journal of Combinatorial Optimization, 36(4), 1168–1194. https://doi.org/10.1007/s10878-017-0198-x bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient Scheduling on Machines from the Cloud}, volume={36}, DOI={10.1007/s10878-017-0198-x}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={1168–1194} }' chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal of Combinatorial Optimization 36, no. 4 (2017): 1168–94. https://doi.org/10.1007/s10878-017-0198-x.' ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1168–1194, 2017. mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:10.1007/s10878-017-0198-x. short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2017) 1168–1194. date_created: 2017-11-15T10:21:34Z date_updated: 2022-01-06T07:03:27Z ddc: - '040' department: - _id: '63' doi: 10.1007/s10878-017-0198-x file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-14T12:21:34Z date_updated: 2018-03-14T12:21:34Z file_id: '1210' file_name: 706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf file_size: 608614 relation: main_file success: 1 file_date_updated: 2018-03-14T12:21:34Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng page: 1168-1194 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Journal of Combinatorial Optimization publisher: Springer status: public title: Cost-efficient Scheduling on Machines from the Cloud type: journal_article user_id: '15415' volume: 36 year: '2017' ...