scientific article

DOI10.4230/LIPICS.STACS.2010.2465zbMath1230.68207MaRDI QIDQ3113759

Adrian Dumitrescu, Csaba D. Tóth

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4e37.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmlongest non-crossing Hamiltonian cyclelongest non-crossing Hamiltonian pathlongest non-crossing spanning tree

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Configurations of non-crossing rays and related problems

This page was built for publication: