ORL
2008
13 years 5 months ago
2008
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
ORL
2008
13 years 7 months ago
2008
ORL
2008
13 years 7 months ago
2008
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
ORL
2008
13 years 7 months ago
2008
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
ORL
2008
13 years 7 months ago
2008
We study a collaborative multicommodity flow game where individual players own capacity on the edges of the network and share this capacity to deliver commodities. We present memb...
ORL
2008
13 years 7 months ago
2008
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
ORL
2008
13 years 7 months ago
2008
The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides p...
ORL
2008
13 years 7 months ago
2008
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
ORL
2008
13 years 7 months ago
2008
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2n - 2 "sharp"...
ORL
2008
13 years 7 months ago
2008
We consider polling systems with general service times and switch-over times, gated service at all queues and with general renewal arrival processes. We derive closed-form express...