73 citations · 785 across the 86 of their papers we have counts for
Showing 2008 · cs.DSShow all
3 papers · 2 filters
cs.DS2008★ 23 cited
Stackelberg Network Pricing is Hard to Approximate
Gwenaël Joret
In the Stackelberg Network Pricing problem, one has to assign tariffs to a certain subset of the arcs of a given transportation network. The aim is to maximize the amount paid by t…
cs.DS2008★ 6 cited
An Efficient Algorithm for Partial Order Production
Jean Cardinal, Samuel Fiorini, Gwenaël Joret +2
We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number o…
cs.DS2008★ 13 cited
Minimum Entropy Orientations
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy se…