6413 search results - page 9 / 1283 » Classes of cycle bases |
ALENEX
2001
14 years 11 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
109
click to vote
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
GD
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
103
click to vote
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
151
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
This paper proposes a cycle accounting architecture for Simultaneous Multithreading (SMT) processors that estimates the execution times for each of the threads had they been execu...