<--- Back to Details
First PageDocument Content
Graph theory / Degree / Multigraph / Eulerian path / Directed graph / Bipartite graph / Graph / Travelling salesman problem / Matching
Date: 2013-08-22 13:00:35
Graph theory
Degree
Multigraph
Eulerian path
Directed graph
Bipartite graph
Graph
Travelling salesman problem
Matching

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One Markus Bl¨ aser Institut f¨ ur Theoretische Informatik, ETH Z¨

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Download Document from Source Website

File Size: 129,22 KB

Share Document on Facebook

Similar Documents