On data reduction for dynamic vector bin packing von van Bevern, René, Melnikov, Andrey, Smirnov, Pavel V., Tsidulko, Oxana Yu

Volltext

Fixed-Parameter Algorithms for Maximum-Profit Facility Location Under Matroid Constraints von van Bevern, René, Tsidulko, Oxana Yu, Zschoche, Philipp

Volltext

On approximate data reduction for the Rural Postman Problem: Theory and experiments von Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

Volltext

Parameterized algorithms and data reduction for the short secluded s‐t‐path problem von Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

Volltext

Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU von van Bevern, René, Kirilin, Artem M., Skachkov, Daniel A., Smirnov, Pavel V., Tsidulko, Oxana Yu

Volltext

The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable von Afanasev, Vsevolod A., van Bevern, René, Tsidulko, Oxana Yu

Volltext

Representative families for matroid intersections, with applications to location, packing, and covering problems von van Bevern, René, Tsidulko, Oxana Yu, Zschoche, Philipp

Volltext

The TSP-approach to approximate solving the m-Cycles Cover Problem von Gimadi, Edward Kh, Rykov, Ivan, Tsidulko, Oxana

Volltext

Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs von Gimadi, Edward Kh, Tsidulko, Oxana

Volltext

Facility location under matroid constraints: fixed-parameter algorithms and applications von Bevern, René Van, Tsidulko, Oxana Yu, Zschoche, Philipp

Volltext bestellen

Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU von René van Bevern, Kirilin, Artem M, Skachkov, Daniel A, Smirnov, Pavel V, Oxana Yu Tsidulko

Volltext

Representative families for matroid intersections, with applications to location, packing, and covering problems von René van Bevern, Oxana Yu Tsidulko, Zschoche, Philipp

Volltext

The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable von Afanasev, Vsevolod A, René van Bevern, Oxana Yu Tsidulko

Volltext

On approximate data reduction for the Rural Postman Problem: Theory and experiments von René van Bevern, Fluschnik, Till, Oxana Yu Tsidulko

Volltext

On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem von Gimadi, Edward Kh, Tsidulko, Oxana Yu

Volltext

Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem von Gimadi, Edward Kh, Tsidulko, Oxana Yu

Volltext

On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs von Gimadi, Edward Kh, Istomin, Alexey M., Tsidulko, Oxana Yu

Volltext

On data reduction for dynamic vector bin packing von René van Bevern, Melnikov, Andrey, Smirnov, Pavel, Tsidulko, Oxana

Volltext

Parameterized algorithms and data reduction for the short secluded $s$-$t$-path problem von van Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

Volltext bestellen

The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable von Afanasev, Vsevolod A., Bevern, René Van, Tsidulko, Oxana Yu

Volltext bestellen