Issue Downloads
Nonhomogeneous Place-dependent Markov Chains, Unsynchronised AIMD, and Optimisation
A stochastic algorithm is presented for a class of optimisation problems that arise when a group of agents compete to share a single constrained resource in an optimal manner. The approach uses intermittent single-bit feedback, which indicates a ...
On the Complexity of Hazard-free Circuits
- Christian Ikenmeyer,
- Balagopal Komarath,
- Christoph Lenzen,
- Vladimir Lysikov,
- Andrey Mokhov,
- Karteek Sreenivasaiah
The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded ...
Hierarchical Clustering: Objective Functions and Algorithms
Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering was based on providing algorithms, rather than optimizing a specific ...
A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The theory admits ...
The Salesman’s Improved Paths through Forests
We give a new, strongly polynomial-time algorithm and improved analysis for the metric s-t path Traveling Salesman Problem (TSP). It finds a tour of cost less than 1.53 times the optimum of the subtour elimination linear program (LP), while known ...
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
We present a (1+ε)-approximation algorithm with quasi-polynomial running time for computing a maximum weight independent set of polygons from a given set of polygons in the plane. Contrasting this, the best-known polynomial time algorithm for the ...
Bandits and Experts in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is well ...
Infinite-duration Bidding Games
<?tight?>Two-player games on graphs are widely studied in formal methods, as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common ...
