We have obtained a constant-factor approximation for Ordered k-Median\xspace. We have extended the less detailed version of the analysis of the algorithm by Charikar and Li [14] for k-Median\xspace, and hence our constants can probably be improved. …

We study the Ordered k-Median problem, in which the solution is evaluated by first sorting the client connection costs and then multiplying them with…

In the online packet scheduling problem with deadlines (PacketScheduling, for short), the goal is to schedule transmissions of packets that arrive ov…

Let pi_w denote the failure function of the Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array…

In this paper, we present a new iterative approximate method of solving boundary value problems. The idea is to compute approximate polynomial soluti…

In the maximum asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we w…

In the Min-cost Perfect Matching with Delays (MPMD) problem, 2 m requests arrive over time at points of a metric space. An online algorithm has to co…

We have presented a (7+ε)-approximation algorithm for the CKM problem, which consists of three building blocks: approximation for Uncapacitated KM, metric embedding into a simpler structure, and a parameterized algorithm working on ℓ-centered instan…

Capacitated k-median is one of the few outstanding optimization problems for which the existence of a polynomial time constant factor approximation a…

Even though the input size is significantly larger than the size of communication allowed in a single round, we still can apply some results from the MPC models to the Node Congested Clique. The key part is to provide a reduction of the problem on g…

The Congested Clique model, proposed by Lotker et al. [SPAA'03, SICOMP'05], was introduced in order to provide a simple abstraction for overlay netwo…

We showed that Configuration LP helps obtaining an algorithm with 1+ϵ capacity violation for uniform capacities. It remains open if a similar result is possible for general capacities. It seems that the difficulty of generalizing our algorithm to ge…

We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the number of facilities o…

Motivated by the imminent growth of massive, highly redundant genomic databases, we study the problem of compressing a string database while simultan…

Reliability, security and stability of cloud services without sacrificing too much resources have become a desired feature in the area of workload ma…

This paper initiates the study of the classic balanced graph partitioning problem from an online perspective: Given an arbitrary sequence of pairwise…

We have found two new types of aperiodic semigroups. Maximal semiconstant semigroups of type Dscti(ΔQ(n1,…,nm)) are currently the largest aperiodic semigroups known. A tight upper bound on the size of aperiodic semigroups remains unknown.

The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of th…

We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In ea…

We have demonstrated a graph-based dependency parser implemented as a single deep neural network that directly produces parse trees from characters and does not require other NLP tools such as a POS tagger. The proposed parser can be easily used in …

We show that a recently proposed neural dependency parser can be improved by joint training on multiple languages from the same family. The parser is…

In this Section we will prove Lemma 1. Let us start with some notation we will use throughout this section. Each path and cycle in this section denotes a meta-path and a meta-cycle. Also we will use the relative notation of degrees. If M is a B-matc…

Given a graph $G=(V,E)$ and for each vertex $v \in V$ a subset $B(v)$ of the set $\{0,1,\ldots, d_G(v)\}$, where $d_G(v)$ denotes the degree of verte…

In this paper we present a really simple linear-time algorithm constructing a context-free grammar of size O(g log (N/g)) for the input string, where…

While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be ex…

We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted…

In this paper, we evolve a card-choice strategy for the arena mode of Legends of Code and Magic, a programming game inspired by popular collectible c…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account