Serge Gaspers
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Serge Gaspers has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Raible
Univ. Trier FB 4-Abteilung Informatik D-54286 Trier Germany
1 shared publication - Gregory B. Sorkin
Department of Mathematics The London School of Economics and Political Science London UK
1 shared publication - Henning Fernau
Universität Trier
1 shared publication - Margaret-Ellen Messinger
Dalhousie University
1 shared publication - Paweł Prałat
Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada B3H 3J5
1 shared publication - Richard J. Nowakowski
Dalhousie Univ, Halifax, NS, Canada
1 shared publication
Latest Publications
- Open Access
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
In this paper we introduce "hybrid" Max 2-CSP formulas consisting of "simple clauses", namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, which can be any integer-valued functions of pairs of boolean variables. This allows an algorithm to use both efficient reductions specific to AND and OR clauses, and other powerful reductions that require the general CSP setting. We use new reductions introduced here, and recent reductions such as "clause-learning" and "2-reductions" generalized to our setting's mixture of simple and general clauses. Parametrizing an instance by the fraction p of non-simple clauses, we give an exact (exponential-time) algorithm that is the fastest known polynomial-space algorithm for p=0 (which includes the well-studied Max 2-Sat problem but also instances with arbitrary mixtures of AND and OR clauses); the only efficient algorithm for mixtures of AND, OR, and general integer-valued clauses; and tied for fastest for general Max 2-CSP (p=1). Since a pure 2-Sat input instance may be transformed to a general CSP instance in the course of being solved, the algorithm's efficiency and generality go hand in hand. Our algorithm analysis and optimization are a variation on the familiar measure-and-conquer approach, resulting in an optimizing mathematical program that is convex not merely quasi-convex, and thus can be solved efficiently and with a certificate of optimality. We produce a family of running-time upper-bound formulas, each optimized for instances with a particular value of p but valid for all instances.
Open AccessA universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between
In this paper we introduce "hybrid" Max 2-CSP formulas consisting of "simple clauses", namely conjunctions and disjunctions of pairs of variables, and general 2-variable clauses, which can be any integer-valued functions of pairs of boolean variables. This allows an algorithm to use both efficient reductions specific to AND and OR clauses, and other powerful reductions that require the general CSP setting. We use new reductions introduced here, and recent reductions such as "clause-learning" and "2-reductions" generalized to our setting's mixture of simple and general clauses. Parametrizing an instance by the fraction p of non-simple clauses, we give an exact (exponential-time) algorithm that is the fastest known polynomial-space algorithm for p=0 (which includes the well-studied Max 2-Sat problem but also instances with arbitrary mixtures of AND and OR clauses); the only efficient algorithm for mixtures of AND, OR, and general integer-valued clauses; and tied for fastest for general Max 2-CSP (p=1). Since a pure 2-Sat input instance may be transformed to a general CSP instance in the course of being solved, the algorithm's efficiency and generality go hand in hand. Our algorithm analysis and optimization are a variation on the familiar measure-and-conquer approach, resulting in an optimizing mathematical program that is convex not merely quasi-convex, and thus can be solved efficiently and with a certificate of optimality. We produce a family of running-time upper-bound formulas, each optimized for instances with a particular value of p but valid for all instances.
- Open Access
Exact Exponential Time Algorithms for Max Internal Spanning Tree
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form O*(c^n) (c <= 3). The main result, however, is a branching algorithm for graphs with maximum degree three. It only needs polynomial space and has a running time of O*(1.8669^n) when analyzed with respect to the number of vertices. We also show that its running time is 2.1364^k n^O(1) when the goal is to find a spanning tree with at least k internal vertices. Both running time bounds are obtained via a Measure & Conquer analysis, the latter one being a novel use of this kind of analyses for parameterized algorithms.
Open AccessExact Exponential Time Algorithms for Max Internal Spanning Tree
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form O*(c^n) (c <= 3). The main result, however, is a branching algorithm for graphs with maximum degree three. It only needs polynomial space and has a running time of O*(1.8669^n) when analyzed with respect to the number of vertices. We also show that its running time is 2.1364^k n^O(1) when the goal is to find a spanning tree with at least k internal vertices. Both running time bounds are obtained via a Measure & Conquer analysis, the latter one being a novel use of this kind of analyses for parameterized algorithms.
- 15 January 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (10) , 463-467
Clean the graph before you draw it!
- 15 January 2009
- Published by Elsevier in Information Processing Letters
- Vol. 109 (10) , 463-467
Clean the graph before you draw it!