13 citations · 25 across the 18 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for s…
cs.DM2007
Minimum Sum Edge Colorings of Multicycles
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigne…