Sciweavers

5889 search results - page 309 / 1178
» Graph Layout Problems
Sort
View
COR
2007
108views more  COR 2007»
15 years 6 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 12 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
16 years 1 months ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
Dániel Marx, Igor Razgon
198
Voted
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
15 years 8 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
IAJIT
2006
109views more  IAJIT 2006»
15 years 6 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...