8 citations · 15 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
TSP Tours in Cubic Graphs: Beyond 4/3
José R. Correa, Omar Larré, José A. Soto
After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic 2-connected graph, has a H…
cs.CG2013
Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line : Algorithms and Complexity
José R. Correa, Laurent Feuilloley, Pablo Pérez-Lantero +1
Finding a maximum independent set (MIS) of a given fam- ily of axis-parallel rectangles is a basic problem in computational geom- etry and combinatorics. This problem has attracted…