1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2014
Graph-TSP from Steiner Cycles
Satoru Iwata, Alantha Newman, R. Ravi
We present an approach for the traveling salesman problem with graph metric based on Steiner cycles. A Steiner cycle is a cycle that is required to contain some specified subset of…
math.CO2014★ 1 cited
Extended Formulations for Sparsity Matroids
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh +2
We show the existence of a polynomial-size extended formulation for the base polytope of a -sparsity matroid. For an undirected graph , the size of the formulati…