Publications related to A Recovery Algorithm for a Disrupted Airline Schedule

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

2024

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Adam Teodor Polak, Alexandra Anna Lassota

We solve the Bin Packing problem in O^*(2^k) time, where k is the number of items less or equal to one third of the bin capacity. This parameter measures the distance from the polynomially solvable case of only large (i.e., greater than one third) items. O ...

Schloss Dagstuhl – Leibniz-Zentrum fur Informatik2022

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Adam Teodor Polak, Marek Elias

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We d ...

2021

A Reinforcement Learning Approach to Train Routing and Scheduling

Zora Oswald

Good train scheduling for a big network with many trains is very hard to achieve. As the trains are competing for the tracks with one another, the number of constraints grows rapidly. Trying to take advantage of emerging technologies in the areas of optimi ...

2020

Freight railway network design problem

Michel Bierlaire, Virginie Janine Camille Lurkin, Nikola Obrenovic

In freight railway networks, commodities are usually transported via hubs, which are called marshaling or shunting yards, depending on their capacity. Consequently, the number and locations of these yards effect the transport costs to a great extent. The ...

2018

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

Pattern formation with voluminous processes

Alexandre David Olivier Maurer

When a shoal of small fishes notices a predator, they typically change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. This motivates us to design algorithms with similar properties. In this p ...

EPFL2016

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Pascal Frossard

In free viewpoint video, a viewer can choose at will any camera angle or the so-called "virtual view" to observe a dynamic 3-D scene, enhancing his/her depth perception. The virtual view is synthesized using texture and depth videos of two anchor camera vi ...

2015

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

A Recovery Algorithm for a Disrupted Airline Schedule

Graph Chatbot

Chat with Graph Search

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

A Reinforcement Learning Approach to Train Routing and Scheduling

Freight railway network design problem

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Dynamic Facility Location via Exponential Clocks

Pattern formation with voluminous processes

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Centrality of trees for capacitated -center

A Reinforcement Learning Approach to Train Routing and Scheduling

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs

Freight railway network design problem

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Dynamic Facility Location via Exponential Clocks

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Centrality of trees for capacitated -center

Pattern formation with voluminous processes