4 papers
Online Interval Selection on a Simple Chain
Yaqiao Li, Ali Mohammad Lavasani, Denis Pankratov
A set of intervals forms a simple chain if, for every , interval overlaps only with and . We show that a…
On the Online Weighted Non-Crossing Matching Problem
Joan Boyar, Shahin Kamali, Kim S. Larsen +3
We introduce and study the weighted version of an online matching problem in the Euclidean plane with non-crossing constraints: points with non-negative weights arrive online, and…
Newman's theorem via Carathéodory
Yaqiao Li, Ali Mohammad Lavasani, Mehran Shakerinava
We give a streamlined short proof of Newman's theorem in communication complexity by applying the classical and the approximate Carathéodory's theorems.
Renting Servers for Multi-Parameter Jobs in the Cloud
Yaqiao Li, Mahtab Masoori, Lata Narayanan +1
We study the Renting Servers in the Cloud problem (RSiC) in multiple dimensions. In this problem, a sequence of multi-parameter jobs must be scheduled on servers that can be rented…