Sciweavers

59 search results - page 3 / 12
» Red-blue covering problems and the consecutive ones property
Sort
View
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 7 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae
MICS
2010
124views more  MICS 2010»
13 years 2 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
CIE
2010
Springer
13 years 10 months ago
A Faster Algorithm for Finding Minimum Tucker Submatrices
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are centr...
Guillaume Blin, Romeo Rizzi, Stéphane Viale...
MST
2007
154views more  MST 2007»
13 years 6 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
CPAIOR
2010
Springer
13 years 10 months ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan