-
13/9-approximation for Graphic TSP
International audience -
The Power of Local Search: Maximum Coverage over a Matroid
International audience -
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and g...
International audience -
Tractability and approximability of maximal strip recovery
International audience -
Constructing Incremental Sequences in Graphs
Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small... -
On the Complexity of Bandwidth Allocation in Radio Networks with Steady Traff...
In this paper we define and study a call scheduling problem that is motivated by radio networks. In such networks the physical space is a common resource that nodes... -
GMPLS Label Space Minimization through Hypergraph Layouts
International audience -
Heterogeneous Resource Allocation under Degree Constraints
International audience -
New trends in Markov models and related learning to restore data
International audience -
A Case for Strongly Polynomial Time Sub-Polyhedral Scheduling Using Two-Varia...
International audience -
On multiprocessor temperature-aware scheduling problems
International audience -
Hardness and approximation of gathering in static radio networks
In this paper, we address the problem of gathering information in a specific node (or \emph{sink}) of a radio network, where interference constraints are present. We... -
Sub-Polyhedral Compilation using (Unit-)Two-Variables-Per-Inequality Polyhedra
The goal of this thesis is to design algorithms that run with better complexity when compiling or parallelizing loop programs. The framework within which our... -
Co-Scheduling Algorithms for High-Throughput Workload Execution
This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum... -
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
International audience -
Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer ...
International audience -
The k-separator problem
International audience -
Multicolor traveling salesman problem: approximation and feasibility
The multicolor traveling salesman problem (MTSP) is defined on a complete graph whose vertex set is partitioned into $k$ subsets, identified with colors. It aims to... -
Parameterized and Exact Computation7th International Symposium, IPEC 2012, Lj...
International audience
