#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2010

2015

- This year (0)
- Last 5 years (6)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan
- Algorithmica
- 2014

We consider the Vector Scheduling problem, a natural generalization of the classical makespan minimization problem to multiple resources. Here, we are given n jobs, represented as d-dimensional vectors in $$[0,1]^d$$ [ 0 , 1 ] d , and m identical machines, and the goal is to assign the jobs to machines such that the maximum load of each machine over all theâ€¦ (More)

- Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan
- ICALP
- 2012

We study the Minimum Latency Submodular Cover (MLSC) problem, which consists of a metric (<i>V</i>, <i>d</i>) with source <i>r</i> ∈ <i>V</i> and <i>m</i> monotone submodular functions <i>f</i><sub>1</sub>, <i>f</i><sub>2</sub>, …, <i>f<sub>m</sub></i>: 2<sup><i>V</i></sup> → [0, 1]. The goal is to find a path originating at <i>r</i>â€¦ (More)

In this paper we consider the problem of finding a graph separator of a given size that decomposes the graph into the maximum number of connected components. We present the picture of the computational complexity and the approximability of this problem for several natural classes of graphs. We first provide an overview of the hardness of approximation ofâ€¦ (More)

The Border Gateway Protocol (BGP) serves as the main routing protocol of the Internet and ensures network reachability among autonomous systems (ASes). When traffic is forwarded between the many ASes on the Internet according to that protocol, each AS selfishly routes the traffic inside its own network according to some internal protocol that supports theâ€¦ (More)

We study the problem of assigning n tasks to m identical parallel machines in the real-time scheduling setting, where each task recurrently releases jobs that must be completed by their deadlines. The goal is to find a partition of the task set over the machines such that each job that is released by a task can meet its deadline. Since this problem isâ€¦ (More)

- SebastiÃ¡n MarbÃ¡n, Ruben van der Zwaan, Alexander Grigoriev, Benjamin Hiller, Tjark Vredeveld
- Oper. Res. Lett.
- 2012

We study a dynamic pricing problem for a company that sells a single product to a group of customers over a finite time horizon. These customers are price sensitive and the price of today influences the group of customers of tomorrow. The objective is to set the prices over time so as to maximize revenue. We study two customer models: a multiplicative andâ€¦ (More)

- AndrÃ© Berger, Alexander Grigoriev, Ruben van der Zwaan
- Networks
- 2014

In this article, we consider k -way vertex cut: the problem of finding a graph separator of a given size that decomposes the graph into the maximum number of components. Our main contribution is the derivation of an efficient polynomial-time approximation scheme for the problem on planar graphs. Also, we show that k -way vertex cut is polynomially solvableâ€¦ (More)

- Martijn van Brink, Ruben van der Zwaan
- ESA
- 2014

During the loading phase of a vessel, only the containers that are on top of their stack are directly accessible. If the container that needs to be loaded next is not the top container, extra moves have to be performed, resulting in an increased loading time. One way to resolve this issue is via a procedure called premarshalling. The goal of premarshallingâ€¦ (More)

- AndrÃ© Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan
- Oper. Res. Lett.
- 2014

We consider the problem of scheduling unit-length jobs on identical machines subject to precedence constraints. We show that natural scheduling rules fail when the precedence constraints form a collection of stars or a collection of complete bipartite graphs. We prove that the problem is in fact NP-hard on collections of stars when the input is given in aâ€¦ (More)

Many combinatorial problems involving weights can be formulated as a so-called ranged problem. That is, their input consists of a universe U , a (succinctly-represented) set family F âŠ† 2 , a weight function Ï‰ : U â†’ {1, . . . , N}, and integers 0 â‰¤ l â‰¤ u â‰¤ âˆž. Then the problem is to decide whether there is an X âˆˆ F such that l â‰¤ âˆ‘ eâˆˆX Ï‰(e) â‰¤ u. Well-knownâ€¦ (More)