B
Bruno Escoffier
Researcher at University of Paris
Publications - 125
Citations - 1787
Bruno Escoffier is an academic researcher from University of Paris. The author has contributed to research in topics: Approximation algorithm & Vertex cover. The author has an hindex of 20, co-authored 114 publications receiving 1653 citations. Previous affiliations of Bruno Escoffier include Paris Dauphine University & Centre national de la recherche scientifique.
Papers
More filters
Proceedings Article
Single-peaked consistency and its complexity
TL;DR: A more efficient algorithm is given and some related issues are addressed, such as the number of orders that may be compatible with a given profile, or the communication complexity of preference aggregation under the single-peakedness assumption.
Journal ArticleDOI
Reoptimization of minimum and maximum traveling salesman's tours
TL;DR: In this paper, reoptimization versions of the traveling salesman problem (TSP) are addressed and it is shown that, dealing with metric MaxTSP, a simple heuristic is asymptotically optimum when a constant number of nodes are inserted.
Journal ArticleDOI
Fast Algorithms for max independent set
TL;DR: This work proposes a method that “propagates” improvement of the worst-case complexity for “sparse” instances to “denser” ones and shows an easy though non-trivial application of it to the min set cover problem.
Book ChapterDOI
Complexity and Approximation in Reoptimization
TL;DR: What kind of performance the authors can expect for specific classes of problems is discussed and then some classical optimization problems in which this approach has been fruitfully applied are presented.
Journal ArticleDOI
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
TL;DR: It is proved that this problem is polynomial in chordal graphs, has a PTAS in planar graphs, is APX-hard in bipartite graphs and is 5/3-approximable in any class of graphs where the vertex cover problem isPolynomial.