Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Byrka, J."'
We study online competitive algorithms for the line chasing problem in Euclidean spaces Rd, where the input consists of an initial point P0 and a sequence of lines X1,X2,...,Xm, revealed one at a time. At each step t, when the line Xt is revealed, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::370d7c3096398b5626eab465441334b8
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Scopus-Elsevier
The $k$-Facility Location problem is a generalization of the classical problems $k$-Median and Facility Location. The goal is to select a subset of at most $k$ facilities that minimizes the total cost of opened facilities and established connections
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8cb7d61e808b2968ca51e27b1abd4cf
Publikováno v:
Discrete Applied Mathematics, 158(11), 1136-1147. Elsevier
Algorithms and Computation (Proceedings 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008), 484-495
STARTPAGE=484;ENDPAGE=495;TITLE=Algorithms and Computation (Proceedings 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008)
Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008)
Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Dec 2008, Gold Coast, Australia. pp.484--495, ⟨10.1007/978-3-540-92182-0_44⟩
Algorithms and Computation ISBN: 9783540921813
ISAAC
Algorithms and Computation (Proceedings 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008), 484-495
STARTPAGE=484;ENDPAGE=495;TITLE=Algorithms and Computation (Proceedings 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008)
Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008)
Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Dec 2008, Gold Coast, Australia. pp.484--495, ⟨10.1007/978-3-540-92182-0_44⟩
Algorithms and Computation ISBN: 9783540921813
ISAAC
A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time approximability of two related optimization problems called the maximum rooted tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea470f8f27e30ee187f9b7c5077dd94e
https://research.tue.nl/nl/publications/e549ca97-c6e2-485e-8bf2-764daf2acc75
https://research.tue.nl/nl/publications/e549ca97-c6e2-485e-8bf2-764daf2acc75
Autor:
Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A., Tollis, I.G., Patrignani, M.
Publikováno v:
Graph Drawing (16th International Symposium, GD'08, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers), 324-335
STARTPAGE=324;ENDPAGE=335;TITLE=Graph Drawing (16th International Symposium, GD'08, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers)
STARTPAGE=324;ENDPAGE=335;TITLE=Graph Drawing (16th International Symposium, GD'08, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers)
A binary tanglegram is a pair of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics, it is essential that both trees are drawn without edge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::8e0273ca863ec3c378a0f425a4e38a48
https://research.tue.nl/nl/publications/6a4fc556-ec00-4194-89c7-e8419c21258f
https://research.tue.nl/nl/publications/6a4fc556-ec00-4194-89c7-e8419c21258f
Autor:
Byrka, J.
Despite a great effort, researchers are unable to find efficient algorithms for a number of natural computational problems. Typically, it is possible to emphasize the hardness of such problems by proving that they are at least as hard as a number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::55c0da2da44b3dfc81dd0a99fe80eec0
https://research.tue.nl/nl/publications/2a326f4c-02bd-4608-b4e7-3dbc93e4c7af
https://research.tue.nl/nl/publications/2a326f4c-02bd-4608-b4e7-3dbc93e4c7af
Publikováno v:
Proceedings of the 10th International Workshop on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX 2007) and of the 11th International Workshop (RANDOM 2007) 20-22 August 2007, Princeton, New Jersey, USA, 29-43
STARTPAGE=29;ENDPAGE=43;TITLE=Proceedings of the 10th International Workshop on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX 2007) and of the 11th International Workshop (RANDOM 2007) 20-22 August 2007, Princeton, New Jersey, USA
STARTPAGE=29;ENDPAGE=43;TITLE=Proceedings of the 10th International Workshop on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX 2007) and of the 11th International Workshop (RANDOM 2007) 20-22 August 2007, Princeton, New Jersey, USA
We consider the metric uncapacitated facility location problem(UFL). In this paper we modify the (1¿+¿2/e)-approximation algorithm of Chudak and Shmoys to obtain a new (1.6774,1.3738)- approximation algorithm for the UFL problem. Our linear program
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f0ff9ac0d1f45e63ba18a0b27c7515f4
https://ir.cwi.nl/pub/11721
https://ir.cwi.nl/pub/11721
Autor:
Bijvank, M., Byrka, J., van Heijster, P., Gnedin, A.V., Olejniczak, T., Swist, T., Zyprych, J., Bisseling, R.H., Mulder, J., Paelinck, M., de Ridder, H., Dajani, K., Dijkema, T.J., van de Leur, J.W., Zegeling, P.A.
In this paper, we will discuss the issue of rostering jobs of cabin crew attendants at KLM.Generated schedules get easily disrupted by events such as illness of an employee. Obviously, reservepeople have to be kept ‘on duty’ to resolve such disru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______101::8b1534f2515ad05d4c08feda9eeb6565
https://dspace.library.uu.nl/handle/1874/378667
https://dspace.library.uu.nl/handle/1874/378667