Logo TU Ilmenau

Foto des Ansprechpartners

Prof. Dr. rer. nat. habil. Matthias Kriesell


Telefon +49 3677 69-3633

E-Mail senden

Ihre Position



Veröffentlichungen am Institut für Mathematik seit 1990

Anzahl der Treffer: 1182
Erstellt: Mon, 30 Mar 2020 08:22:47 +0200 in 0.0583 sec

Lo, On-Hei Solomon; Schmidt, Jens M.; Van Cleemput, Nico; Zamfirescu, Carol T.;
Shortness coefficient of cyclically 4-edge-connected cubic graphs. - In: The electronic journal of combinatorics. - [Madralin] : EMIS ELibEMS, ISSN 10778926, Volume 27 (2020), issue 1, P1.43, Seite 1-14
Mehrez, Mohamed W.; Worthmann, Karl; Cenerini, Joseph P. V.; Osman, Mostafa; Melek, William W.; Jeon, Soo;
Model predictive control without terminal constraints or costs for holonomic mobile robots. - In: Robotics and autonomous systems : international journal.. - Amsterdam [u.a.] : Elsevier, ISSN 1872-793X, Bd. 127 (2020), 103468
Giribet, Juan; Langer, Matthias; Martínez Pería, Francisco; Philipp, Friedrich; Trunk, Carsten;
Spectral enclosures for a class of block operator matrices. - In: Journal of functional analysis. - Amsterdam [u.a.] : Elsevier, ISSN 1096-0783, Bd. 278 (2020), 10, S. 108455
Hildenbrandt, Regina;
The k-server problem with parallel requests and the compound work function algorithm. - In: Baltic journal of modern computing. - [S.l.], ISSN 2255-8950, Bd. 8 (2020), 1, S. 1-20

In this paper the compound work function algorithm for solving the generalized k-server problem is proposed. This problem is an online k-server problem with parallel requestswhere several servers can also be located on one point. In 1995 Koutsoupias and Papadimitriouhave proved that the well-known work function algorithm is competitive for the (usual) k-serverproblem. A proof, where a potential-like function argument is included, was given by Borodinand El-Yaniv in 1998. Unfortunately, certain techniques of these proofs cannot be applied to showthat a natural generalization of the work function algorithm is competitive for the problem withparallel requests. Values of work functions, which are used by the compound work function algo-rithm are derived from a surrogate problem, where at most one server must be moved in servicingthe request in each step. We can show that the compound work function algorithm is competitivewith the same bound of the ratio as in the case of the usual problem.
Kriesell, Matthias;
Maximal ambiguously k-colorable graphs. - In: Journal of combinatorial theory : JCTB.. - Orlando, Fla. : Academic Press, Bd. 140 (2020), S. 248-262
Rocktäschel, Stefan;
A branch-and-bound algorithm for multiobjective mixed-integer convex optimization. - Wiesbaden : Springer Fachmedien Wiesbaden GmbH, 2020. - VII, 64 Seiten. . - (BestMasters) ISBN 978-3-658-29148-8

Sauerteig, Philipp; Worthmann, Karl;
Towards multiobjective optimization and control of smart grids. - In: Optimal control, applications and methods. - New York, NY [u.a.] : Wiley, ISSN 1099-1514, Bd. 41 (2020), 1, S. 128-145
Preißer, Johanna E.; Schmidt, Jens M.;
Computing vertex-disjoint paths in large graphs using MAOs. - In: Algorithmica : an international journal in computer science.. - New York, NY : Springer, ISSN 1432-0541, Bd. 82 (2020), 1, S. 146-162
Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M.;
Longer cycles in essentially 4-connected planar graphs. - In: Discussiones mathematicae. - Warsaw : De Gruyter Open, ISSN 2083-5892, Bd. 40 (2020), 1, S. 269-277
Braun, Philipp; Grüne, Lars; Kellett, Christopher M.; Weller, Steven R.; Worthmann, Karl;
Towards price-based predictive control of a small-scale electricity network. - In: International journal of control. - London : Taylor & Francis, ISSN 1366-5820, Bd. 93 (2020), 1, S. 40-61