#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2015

2016

- This year (0)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Christian Kudahl
- CIAC
- 2015

The problem of determining if the on-line chromatic number of a graph is less than or equal to k, given a pre-coloring, is shown to be PSPACE-complete.

The advice complexity of an online problem is a measure of how much knowledge of the future an online algorithm needs in order to achieve a certain competitive ratio. We determine the advice complexity of a number of hard online problems including independent set, vertex cover, dominating set and several others. These problems are hard, since a single wrong… (More)

- Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
- SIGACT News
- 2016

In online scenarios requests arrive over time, and each request must be serviced in an irrevocable manner before the next request arrives. Online algorithms with advice is an area of research where one attempts to measure how much knowledge of future requests is necessary to achieve a given performance level, as defined by the competitive ratio. When this… (More)

Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples include maximum independent set, maximum planar graph, maximum clique, minimum feedback vertex set, and many others. In online versions of these problems, the vertices of the graph are presented in an adversarial… (More)

- Jhoirene Clemente, Juraj Hromkovic, Dennis Komm, Christian Kudahl
- IWOCA
- 2016

The online search problem is a fundamental problem in finance. The numerous direct applications include searching for optimal prices for commodity trading and trading foreign currencies. In this paper, we analyze the advice complexity of this problem. In particular, we are interested in identifying the minimum amount of information needed in order to… (More)

- Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
- Theory of Computing Systems
- 2016

The advice complexity of an online problem is a measure of how much knowledge of the future an online algorithm needs in order to achieve a certain competitive ratio. Using advice complexity, we define the first online complexity class, AOC. The class includes independent set, vertex cover, dominating set, and several others as complete problems.… (More)

- Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
- Theory of Computing Systems
- 2016

Recently, the first online complexity class, A O C, was introduced. The class consists of many online problems where each request must be either accepted or rejected, and the aim is to either minimize or maximize the number of accepted requests, while maintaining a feasible solution. All A O C-complete problems (including Independent Set, Vertex Cover,… (More)

- Joan Boyar, Christian Kudahl
- IWOCA
- 2015

An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with “enough” isolated vertices, Freckle Graphs. For Online Dominating Set, the greedy algorithm is shown to be worst case online optimal on graphs… (More)

- ‹
- 1
- ›