13 citations · 18 across the 14 of their papers we have counts for
14 papers
Vector TSP: A Traveling Salesperson Problem with Racetrack-like Acceleration Constraints
Arnaud Casteigts, Mathieu Raffinot, Mikhail Raskin +1
We study a new version of the Traveling Salesperson Problem, called \VectorTSP, where the traveler is subject to discrete acceleration constraints, as defined in the paper-and-penc…
On improving the approximation ratio of the r-shortest common superstring problem
Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot +1
The Shortest Common Superstring problem (SCS) consists, for a set of strings S = {s_1,...,s_n}, in finding a minimum length string that contains all s_i, 1<= i <= n, as substrings.…
Optimizing Google Shopping Campaigns Structures With Query-Level Matching
Mathieu Raffinot, Romain Rivière
How to bid on a Google shopping account (set of shopping campaigns) with query-level matching like in Google Adwords.
Indexing and querying color sets of images
Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot
We aim to study the set of color sets of continuous regions of an image given as a matrix of rows over columns where each element in the matrix is an integer from $[1…
A note on the shortest common superstring of NGS reads
Tristan Braquelaire, Marie Gasparoux, Mathieu Raffinot +1
The Shortest Superstring Problem (SSP) consists, for a set of strings S = {s_1,...,s_n}, to find a minimum length string that contains all s_i, 1 <= i <= k, as substrings. This pro…
Practical combinations of repetition-aware data structures
Djamal Belazzougui, Fabio Cunial, Travis Gagie +2
Highly-repetitive collections of strings are increasingly being amassed by genome sequencing and genetic variation experiments, as well as by storing all versions of human-generate…