53 citations · 70 across the 11 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 53 cited
Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane
Hadrien Cambazard, Nicolas Catusse
Given a set of points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. A TSP instance is re…
cs.DS2015★ 2 cited
Bin Packing with Linear Usage Costs
Hadrien Cambazard, Deepak Mehta, Barry O'Sullivan +1
Bin packing is a well studied problem involved in many applications. The classical bin packing problem is about minimising the number of bins and ignores how the bins are utilised.…