2011 IEEE 52nd Annual Symposium on Foundations of…

2011

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our… (More)

In this paper, we investigate to what extent the solution quality of online algorithms can be improved by allowing the algorithm to extract a given amount of information about the input. We consider… (More)

We consider the following reoptimization scenario: Given an instance of an optimization problem together with an optimal solution, we want to find a high-quality solution for a locally modified… (More)

We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges to make a given graph Eulerian, whereas our approach… (More)

Given an instance of the Steiner tree problem together with an optimal solution, we consider the scenario where this instance is modified locally by adding one of the vertices to the terminal set or… (More)

We show how to restrict the analysis of a class of online problems that includes the k-server problem in finite metrics such that we only have to consider finite sequences of request. When applying… (More)

We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines. The execution of any… (More)

A two-way finite automaton is sweeping if its input head can change direction only on the end-markers. For each n ≥ 2, we exhibit a problem that can be solved by a O(n)-state sweeping LasVegas… (More)