CS4335 Design and Analysis of Algorithms
One term paper
d an open problem from
that you are interested in.
Give a short
description (background, application, etc.) of the
And then give
work on this
problem and s
ummarize the current status
No more than 1 page
You can use
to find a problem you like. Usually
contains more details about a problem. You can also use google (scholar.google.c
om) to research the
recent results on a problem. However, plagiarism should be avoided;
that is, you need to write in your own
Attached is a sample just for your reference.
Sample Term Paper
Longest Simple Path Problem
the shortest path problem of a graph can be solved easily.
is to find the longest path
between two vertices. If we allow duplicated
vertices on the path
, the longest path length can be infinity.
disallow duplicated vertices
on a path. Such a path is a
; that is,
a path o
a graph is
The longest simple path
then to fi
longest simple path
between two vertices of a graph. It is
in information retrieval, VLSI design,
undirected weighted graph
is assigned to each
as the respective
. Given two vertices u and v (u, v
is to find
longest simple path from u to v.
he length of a path is defined as total
weights of the edges belonging to the path.
State of the Art
Longest simple path problem
. Genetic algorithm, dynamic
, mixed integer linear programming [
4] have been proposed
address the special instances of the problem
Karger et al.
Garey, M.R., Johnson, D.S
.: Computers and Intractability: A guide to the Theory of
NPCompleteness. W. H. Freeman, 1st ed. (1979)
Wong, W.Y., Lau, T.P., King, I.: Information retrieval in p2p networks using genetic algorithm.
In: Proceedings of the 14th Int. World Wide Web Conferen
ce, Special interest tracks
posters. pp. 922
Schmidt, K., Schmidt, E.G.: A longest
path problem for evaluating the worst
of switched ethernet. In: Proceedings of SIES’2010. pp. 205
Tseng, I.L., Chen, H.W., Lee, C.
path routing with parallel milp
solvers. In: Proceedings of WCECS
ICCS, Vol. 2. pp. 827
Karger, D., Motwani, R., Ramkumar, G.: On approximating the longest path in a
graph.Algorithmica 18, 421