F. Newbery Paulisch. The Design of an Extendible Graph Editor. Number 704 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Lower and Upper Bounds for Large TSPs - Rohe (1997) (1 citation) (Correct)
.... lower bound is needed, the quality is then computed by UB GammaLB LB (UB is the upper bound which is just the length of a found tour, LB is a lower bound, one can guarantee that every tour T is at least as long as LB) A nice overview of existing upper and lower bound heuristics can be found in [5,8]. The best sequential algorithms developed so far are: Lower bounds Very good lower bounds can be computed with Linear Programming, but the best algorithm programmed so far is just able to cope with instances with up to 200000 cities [1] For instances with more cities the best bound is the Held ....
.... but the best algorithm programmed so far is just able to cope with instances with up to 200000 cities [1] For instances with more cities the best bound is the Held Karp bound [2] Upper bounds The best tours for metric instances are found with the iterated Lin Kernighan heuristic, see [4,5,6,8]. In this paper we will discuss parallel versions of lower bound heuristics and iterated Lin Kernighan. The rest of this paper is organized as follows. In Section 2 we present a heuristic to partition a set of points in the plane and compute an initial tour in parallel, in Section 3 we introduce a ....
[Article contains additional citation context not shown here]
G. Reinelt: The Traveling Salesman - Computational Solutions for TSP Applications. Number 840 in Lecture Notes in Computer Science. Springer Verlag, 1994 Address: Rohe, A., University of Bonn, Institute for Discrete Mathematics, Nassestraße 2, D-53113 Bonn
ArchE: A Graph Drawing System for Archaeology - Christoph Hundack Petra (1997) Self-citation (Graph) (Correct)
....try to minimize P ik jA i j jB i j; ie, the number of replacement edges. In the second case we try to minimize k; ie, the number of covering bipartite subgraphs. As these problems are NP hard, NP complete respectively, we have implemented heuristics (for details on edge concentration compare [8]) Additionally ArchE includes an algorithm for finding small complete bipartite subgraphs (see [3] as the existing complete bipartite subgraphs often possess only few vertices. 4 The main layout procedure uses extensions of the Sugiyama algorithm [11] which consists of three phases. First ....
F. Newbery Paulisch. The Design of an Extendible Graph Editor. Number 704 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC