11 citations · 66 across the 33 of their papers we have counts for
Showing 2013 · cs.DSShow all
3 papers · 2 filters
cs.DS2013
Minimum d-dimensional arrangement with fixed points
Anupam Gupta, Anastasios Sidiropoulos
In the Minimum -Dimensional Arrangement Problem (d-dimAP) we are given a graph with edge weights, and the goal is to find a 1-1 map of the vertices into (for some…
cs.DS2013
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
Jeff Erickson, Anastasios Sidiropoulos
We present a near-optimal polynomial-time approximation algorithm for the asymmetric traveling salesman problem for graphs of bounded orientable or non-orientable genus. Our algori…
cs.DS2013★ 3 cited
Approximation algorithms for Euler genus and related problems
Chandra Chekuri, Anastasios Sidiropoulos
The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is k…