#### Filter Results:

- Full text PDF available (32)

#### Publication Year

1992

2019

- This year (4)
- Last 5 years (24)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marc Demange, Vangelis Th. Paschos
- Theor. Comput. Sci.
- 1994

In order to define a polynomial approximation theory linked to combinatorial optimization closer than the existing one, we first formally define the notion of a combinatorial optimization problem and… (More)

We study complexity and approximation of min weighted node coloring in natural graph-families as planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if… (More)

- Marc Demange, Pascal Grisoni, Vangelis Th. Paschos
- Theor. Comput. Sci.
- 1998

We use a new approximation measure, the differential approximation ratio, to derive polynomial-time approximation algorithms for minimum set covering (for both weighted and unweighted cases), minimum… (More)

A version of weighted coloring of a graph is introduced: each node v of a graph G = (V, E) is provided with a positive integer weight w(v) and the weight of a stable set S of G is w(S) = max{w(v): v… (More)

- Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos
- Inf. Process. Lett.
- 2004

The Quota Traveling Salesman Problem is a generalization of the well-known Traveling Salesman Problem. The goal of the traveling salesman is, in this case, to reach a given quota of sales, minimizing… (More)

Abstract The purpose of this paper is mainly to prove the following theorem: for every polynomial time algorithm running in time T ( n ) and guaranteeing standard-approximation ratio ϱ for… (More)

- Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
- Discrete Applied Mathematics
- 2009

We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-hard in planar graphs, even if they are triangle-free and… (More)

- Jean-François Culus, Marc Demange
- SOFSEM
- 2006

This paper is devoted to an oriented coloring problem motivated by a task assignment model. A recent result established the NP-completeness of deciding whether a digraph is κ-oriented colorable; we… (More)

- Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
- J. Scheduling
- 2007

A version of weighted coloring of a graph is introduced which is motivated by some types of scheduling problems: each node v of a graph G corresponds to some operation to be processed (with a… (More)

- Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos
- Int. J. Found. Comput. Sci.
- 2005