Search Sciweavers | Sciweavers

45

SODA
2008
ACM

135views Algorithms» more SODA 2008»

Improved algorithms for orienteering and related problems

14 years 18 days ago

In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...

Chandra Chekuri, Nitish Korula, Martin Pál

claim paper

Read More »

37

click to vote

PPSN
2004
Springer

156views Distributed And Parallel Com...» more PPSN 2004»

An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem

14 years 4 months ago

Download www.ads.tuwien.ac.at

Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of ﬁnding a maximum weight trace in an alignment graph, which is derived from all pairw...

Gabriele Koller, Günther R. Raidl

claim paper

Read More »

32

click to vote

COCO
2007
Springer

87views Algorithms» more COCO 2007»

Parity Problems in Planar Graphs

14 years 5 months ago

Download www.cs.toronto.edu

We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...

Mark Braverman, Raghav Kulkarni, Sambuddha Roy

claim paper

Read More »

43

click to vote

ICPADS
2007
IEEE

134views Distributed And Parallel Com...» more ICPADS 2007»

Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs

14 years 5 months ago

Download sharif.edu

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...

Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi

claim paper

Read More »

29

click to vote

ENDM
2007

100views more ENDM 2007»

Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey

13 years 11 months ago