Marcin Mucha
YOU?
Author Swipe
View article: Matroid-based TSP rounding for half-integral solutions
Matroid-based TSP rounding for half-integral solutions Open
We show how to round any half-integral solution to the subtour-elimination relaxation for the TSP, while losing a less-than $$-$$ 1.5 factor. Such a rounding algorithm was recently given by Karlin, Klein, and Oveis Gharan based on samplin…
View article: An Improved Algorithm for Online Min-Sum Set Cover
An Improved Algorithm for Online Min-Sum Set Cover Open
We study a fundamental model of online preference aggregation, where an algorithm maintains an ordered list of n elements. An input is a stream of preferred sets R_1, R_2, ..., R_t, ... Upon seeing R_t and without knowledge of any future s…
View article: An Improved Algorithm For Online Min-Sum Set Cover
An Improved Algorithm For Online Min-Sum Set Cover Open
We study a fundamental model of online preference aggregation, where an algorithm maintains an ordered list of $n$ elements. An input is a stream of preferred sets $R_1, R_2, \dots, R_t, \dots$. Upon seeing $R_t$ and without knowledge of a…
View article: Improving Ads-Profitability Using Traffic-Fingerprints
Improving Ads-Profitability Using Traffic-Fingerprints Open
This paper introduces the concept of traffic-fingerprints, i.e., normalized 24-dimensional vectors representing a distribution of daily traffic on a web page. Using k-means clustering we show that similarity of traffic-fingerprints is rela…
View article: Rural-urban differences in children’s musculosceletal injuries in North-eastern Poland
Rural-urban differences in children’s musculosceletal injuries in North-eastern Poland Open
ABSTRACTOBJECTIVE. To investigate rural-urban differences in severity of injuries, by means of age, sex and duration of hospitalization of injured children in northeastern Poland.METHODS. The study included children admitted to the Departm…
View article: The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth Open
This year’s Parameterized Algorithms and Computational Experiments challenge (PACE 2020) was devoted to the problem of computing the treedepth of a given graph. Altogether 51 participants from 20 teams, 12 countries and 3 continents submit…
View article: Issue Information ‐ TOC
Issue Information ‐ TOC Open
The Americas, excluding Canada & Mexico), US$1,667 (Canada/Mexico), US$2,801 (Rest of World), €1,817 (Europe), £1,431 (UK
View article: Equal-Subset-Sum Faster Than the Meet-in-the-Middle
Equal-Subset-Sum Faster Than the Meet-in-the-Middle Open
In the Equal-Subset-Sum problem, we are given a set $S$ of $n$ integers and the problem is to decide if there exist two disjoint nonempty subsets $A,B \subseteq S$, whose elements sum up to the same value. The problem is NP-complete. The s…
View article: A subquadratic approximation scheme for partition
A subquadratic approximation scheme for partition Open
The subject of this paper is the time complexity of approximating KNAPSACK, SUBSET SUM, PARTITION, and some other related problems. The main result is an O(n + 1/e5/3) time randomized FPTAS for PARTITION, which is derived from a certain re…
View article: A Subquadratic Approximation Scheme for Partition
A Subquadratic Approximation Scheme for Partition Open
The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an $\widetilde{O}(n+1/\varepsilon^{5/3})$ time randomized FPTAS for Partition, which is …
View article: Applying deep learning to right whale photo identification
Applying deep learning to right whale photo identification Open
Photo identification is an important tool for estimating abundance and monitoring population trends over time. However, manually matching photographs to known individuals is time‐consuming. Motivated by recent developments in image recogni…
View article: Online Facility Location with Deletions
Online Facility Location with Deletions Open
In this paper we study three previously unstudied variants of the online Facility Location problem, considering an intrinsic scenario when the clients and facilities are not only allowed to arrive to the system, but they can also depart at…
View article: Online Facility Location with Deletions
Online Facility Location with Deletions Open
In this paper we study three previously unstudied variants of the online Facility Location problem, considering an intrinsic scenario when the clients and facilities are not only allowed to arrive to the system, but they can also depart at…
View article: On Problems Equivalent to (min,+)-Convolution
On Problems Equivalent to (min,+)-Convolution Open
In the recent years, significant progress has been made in explaining apparent hardness of improving over naive solutions for many fundamental polynomially solvable problems. This came in the form of conditional lower bounds -- reductions …
View article: Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration
Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration Open
In this paper, we construct a deterministic 4-competitive algorithm for the online file migration problem, beating the currently best 20-year old, 4.086-competitive MTLM algorithm by Bartal et al. (SODA 1997). Like MTLM, our algorithm also…
View article: Dynamic beats fixed: On phase-based algorithms for file migration
Dynamic beats fixed: On phase-based algorithms for file migration Open
We construct a deterministic 4-competitive algorithm for the online file migration problem, beating the currently best 20-year-old, 4.086-competitive MTLM algorithm by Bartal et al. (SODA 1997). Like MTLM, our algorithm also operates in ph…
View article: Zmiany we wspólnej organizacji rynku cukru a jego zasięg geograficzny
Zmiany we wspólnej organizacji rynku cukru a jego zasięg geograficzny Open
The aim of the paper was to determine the impact of changes in the common organization of sugar market on the geographical scope using the method Elzinga-Hogarty. The research was conducted before the introduction of the reform in 2006 and…
View article: Geographical delineation of sugar market basing on Eliznga-Hogarty method
Geographical delineation of sugar market basing on Eliznga-Hogarty method Open
The aim of the paper was to define the geographical scope of the sugar market using the Elzinga−Hogarty method. For practical use of this method the authors made three assumptions: 1) sugar market was studied integrally, independently from…
View article: Market delimination on the example of the sugar sector
Market delimination on the example of the sugar sector Open
This paper is aimed at: (1) discussion of the geographical market delimitation, considering the decision-making methods used by antitrust authorities; and (2) verification of the geographical range of the sugar market using the Elzinga-Hog…
View article: Market Delimitation on the Example of the Sugar Sector
Market Delimitation on the Example of the Sugar Sector Open
This paper is aimed at: (1) discussion of the geographical market dimitation, considering the decision-making methods used by antitrust authorities; and (2) verification of the geographical range of the sugar market using the Elzinga-Hogar…