352 search results - page 34 / 71 » Experimental Analysis of Approximation Algorithms for the Ve... |
FUN
2007
Springer
14 years 19 days ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
JDA
2007
13 years 8 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
DAGSTUHL
2008
13 years 10 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
APPROX
2004
Springer
14 years 2 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...