13 citations · 28 across the 7 of their papers we have counts for
7 papers
Makespan Trade-offs for Visiting Triangle Edges
Konstantinos Georgiou, Somnath Kundu, Pawel Pralat
We study a primitive vehicle routing-type problem in which a fleet of unit speed robots start from a point within a non-obtuse triangle , where . The goal is…
Lower Bounds for Shoreline Searching with 2 or More Robots
Sumi Acharjee, Konstantinos Georgiou, Somnath Kundu +1
Searching for a line on the plane with unit speed robots is a classic online problem that dates back to the 50's, and for which competitive ratio upper bounds are known for eve…
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models
Konstantinos Georgiou, George Karakostas, Evangelos Kranakis
We initiate the study of a new problem on searching and fetching in a distributed environment concerning treasure-evacuation from a unit disk. A treasure and an exit are located at…
Know When to Persist: Deriving Value from a Stream Buffer
Konstantinos Georgiou, George Karakostas, Evangelos Kranakis +1
We consider \textsc{Persistence}, a new online problem concerning optimizing weighted observations in a stream of data when the observer has limited buffer capacity. A stream of we…
Lift & Project Systems Performing on the Partial-Vertex-Cover Polytope
Konstantinos Georgiou, Andy Jiang, Edward Lee +3
We study integrality gap (IG) lower bounds on strong LP and SDP relaxations derived by the Sherali-Adams (SA), Lovasz-Schrijver-SDP (LS+), and Sherali-Adams-SDP (SA+) lift-and-proj…
Stable marriage with general preferences
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, w…