Sök böcker

Här kan du söka dig fram till bra böcker. Klicka sen på en bok för att läsa mer om den!

Sökning efter: Christos Levcopoulos 54 träffar

Titel Författare År Språk
21 Exploiting few inversions when sorting - sequential and parallel algorithms Christos Levcopoulos 1993 Engelska
22 C-sensitive triangulation approximate the minmax length triangulation Christos Levcopoulos 1993 Engelska
23 The greedy triangulation can be computed from the delaunay in linear time Christos Levcopoulos 1995 Engelska
24 Computing hierarchies of clusters in linear time from the delaunay triangulation Drago Krznaric 1994 Engelska
25 On parallel complexity of planar triangulaltions Christos Levcopoulos 1995 Engelska
26 Quasi-greedy triangulations approximating the minimum weight triangulation Christos Levcopoulos 1995 Engelska
27 Tight lower bounds for minimum weight triangulation heuristics Christos Levcopoulos 1995 Engelska
28 Close approximation of minimum rectangular covering Christos Levcopoulos 1996 Engelska
29 Linear-time heuristics for minimum weight rectangulation Christos Levcopoulos 1996 Engelska
30 A linear-time heuristic for minimum rectangular covering Christos Levcopoulos 1996 Engelska
31 A near-optimal heuristic for minimum weight triangulation of convex polygons Christos Levcopoulos 1996 Engelska
32 Cutting off well-bounded rectangles Christos Levcopoulos 1996 Engelska
33 Optimal algorithms for complete linkage clustering in d dimensions Christos Levcopoulos 1996 Engelska
34 Approximation algorithms for covering polygons with squares and similar problems Christos Levcopoulos 1996 Engelska
35 Minimum spanning trees in d dimensions Drago Krznaric 1996 Engelska
36 Greedy triangulation approximates the minimum weight triangulation and can be computed in linear time in the average case Christos Levcopoulos 1992 Engelska
37 Efficient algorithms for constructing fault-tolerant geometric spanners Christos Levcopoulos 1998 Engelska
38 A parallel approximation algorithm for minimum weight tgriangulation Joachim Gudmundsson 1997 Engelska
39 A fast aproximation algorithm for TSP with neighborhoods and red-blue separation Joachim Gudmundsson 1997 Engelska
40 Approximating minimum Manhattan Networks Joachim Gudmundsson 1998 Engelska

Förra sidan 1 2 3 Nästa sida

Sökningen görs direkt i Kungl. bibliotekets söktjänst libris. Libris katalog innehåller närmare 7 miljoner titlar från ca 170 bibliotek i Sverige och biblioteken samarbetar om att hålla katalogen uppdaterad. Utan libris skulle inte en tjänst som Boktraven vara möjlig.