Sciweavers

613 search results - page 35 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 9 months ago
The Generalized Dimensionality Reduction Problem
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
Charu C. Aggarwal
WADS
2005
Springer
162views Algorithms» more  WADS 2005»
14 years 1 months ago
The Minimum-Area Spanning Tree Problem
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
14 years 5 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
ANOR
2004
68views more  ANOR 2004»
13 years 7 months ago
Multilevel Refinement for Combinatorial Optimisation Problems
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...
Chris Walshaw
METMBS
2003
128views Mathematics» more  METMBS 2003»
13 years 9 months ago
Genetic Code as a Gray Code Revisited
In this paper we revisit the idea of relating the genetic code to a Gray code. This idea was originally fostered by Rosemary Swanson as a “unifying concept for the amino acid co...
Dragan Bosnacki, Huub M. M. ten Eikelder, Peter A....