Sciweavers

3320 search results - page 72 / 664
» Heuristics for the Phylogeny Problem
Sort
View
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
15 years 10 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
15 years 7 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
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....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
CORR
2012
Springer
225views Education» more  CORR 2012»
14 years 1 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
NEW2AN
2010
Springer
15 years 4 months ago
Heuristic Congestion Control for Message Deletion in Delay Tolerant Network
Delay tolerant network (DTN) challenges on large delay of communication, opportunistic and intermittent connectivity so that data can be transferred over vulnerable network. Most r...
Lertluck Leela-amornsin, Hiroshi Esaki
COCOON
2005
Springer
15 years 11 months ago
A Tight Analysis of the Maximal Matching Heuristic
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
Jean Cardinal, Martine Labbé, Stefan Langer...