Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Maik Weinard"'
Autor:
Maik Weinard, Georg Schnitger
Publikováno v:
SIAM Journal on Discrete Mathematics. 20:502-522
We investigate the greedy algorithm for the shortest common superstring problem. We show that the length of the greedy superstring is upper-bounded by the sum of the lengths of an optimal superstring and an optimal cycle cover, provided the greedy al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f2addb8bc60b1483c7b27a23420b95d
https://doi.org/10.1137/040619144
https://doi.org/10.1137/040619144
Autor:
Maik Weinard, Uli Laube
Publikováno v:
International Journal of Foundations of Computer Science. 16:1219-1230
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic that is widely used is the notorious greedy heuristic. It is known, that t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ef1027000e06d0af4edc7caebbe1260
https://doi.org/10.1142/s0129054105003777
https://doi.org/10.1142/s0129054105003777
Publikováno v:
Algorithm Engineering ISBN: 9783642148651
In the cycle of Algorithm Engineering, the design phase opens after the modeling phase. We may assume that the algorithmic task to be performed is well understood, i. e., that the desired input-output relation is specified, and an agreement has been
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6790519796460a02e3f675263b9df0a
https://doi.org/10.1007/978-3-642-14866-8_3
https://doi.org/10.1007/978-3-642-14866-8_3
Autor:
Maik Weinard
Publikováno v:
Experimental and Efficient Algorithms ISBN: 9783540259206
WEA
WEA
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze classes of queueing strategies. We introduce the class of queueing stra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29d7aacbe0c2e888fe970b60f8b16038
http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/2892
http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/2892
Autor:
Maik Weinard
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540343752
CIAC
CIAC
FIFO is the most prominent queueing strategy due to its simplicity and the fact that it only works with local information. Its analysis within the adversarial queueing theory however has shown, that there are networks that are not stable under the FI
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::439e9ed76b58f747c0081121c9a5ec5c
https://doi.org/10.1007/11758471_11
https://doi.org/10.1007/11758471_11
Autor:
Maik Weinard, Georg Schnitger
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540206804
FSTTCS
FSTTCS
We investigate the greedy algorithm for the shortest common superstring problem. For a restricted class of orders in which strings are merged, we show that the length of the greedy superstring is upper-bounded by the sum of the length of an optimal s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb15e5ee1d60f55db9aa6a7939d08046
https://doi.org/10.1007/978-3-540-24597-1_33
https://doi.org/10.1007/978-3-540-24597-1_33
Autor:
Maik Weinard, Uli Laube
Publikováno v:
International Journal of Foundations of Computer Science. 17:247-247
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba4b8227c252dfb7364fc6ed2ed298ee
https://doi.org/10.1142/s0129054106003796
https://doi.org/10.1142/s0129054106003796