7 papers
On Fréchet Traveling Salesmen Problems
Omrit Filtser, Tzalik Maimon, Michal Moiseev
The Fréchet distance is a well-studied distance measure between two curves. In this work, we demonstrate that the merit of Fréchet distance extends beyond evaluating similarity, an…
Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
Omrit Filtser, Tzalik Maimon, Ofir Yomtovyan
The minimum convex cover problem seeks to cover a polygon with the fewest convex polygons that lie within . This problem is -complete, and the best previou…
Interference in Wireless Networks -- A Power Allocation Approach
Tzalik Maimon, Shirley Alus, Gil Kedar
Co-Channel Interference (CCI) is a fundamental problem in wireless communication networks. It is a well-studied problem in the field. As channels use the same frequency, interferen…
RRO: A Regularized Routing Optimization Algorithm for Enhanced Throughput and Low Latency with Efficient Complexity
David Zenati, Tzalik Maimon, Kobi Cohen
In the rapidly evolving landscape of wireless networks, achieving enhanced throughput with low latency for data transmission is crucial for future communication systems. While low…
Sleeping Model: Local and Dynamic Algorithms
Tzalik Maimon
In recent years the sleeping model came to the focus of researchers. In this model nodes can go into a sleep state in which they spend no energy but at the same time cannot receive…
Deterministic Logarithmic Completeness in the Distributed Sleeping Model
Leonid Barenboim, Tzalik Maimon
We provide a deterministic scheme for solving any decidable problem in the distributed {sleeping model}. The sleeping model is a generalization of the standard message-passing mode…
Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity
Leonid Barenboim, Michael Elkin, Tzalik Maimon
We consider coloring problems in the distributed message-passing setting. The previously-known deterministic algorithms for edge-coloring employed at least (2Delta - 1) colors, eve…