Hello,<div><br></div><div>I am looking around recently to get an appropriate topic.</div><div><br></div><div>Here are something I would like to work on:</div><div>1. K-shortest path</div><div>I want to implement an revised <span style="background-color:rgb(255,255,255);font-family:arial,sans-serif;font-size:13px;line-height:16px">Yen’s algorithm based on this paper:</span></div>
<div><span style="background-color:rgb(255,255,255);font-family:arial,sans-serif;font-size:13px;line-height:16px"><a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.2372">http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.2372</a></span></div>
<div>2. a new shortest path algorithm</div><div>I revised the classical two-q algorithm, and got a new algorithm named mild-two-q, here is my paper:</div><div><a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5455361&tag=1">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5455361&tag=1</a>
</div><div>3. <span style>Contraction Hierarchies Algorithm</span></div><div><span style><br></span></div><div><span style>The first one is the one I like mostly. If it is not already done and no body else is working on it, I want to do it.</span></div>
<div>The second one is also interesting. Since I developed the algorithm, I definitely want to apply it to a widely used program. But as it is not tested in many road networks, the practical efficiency can not be guaranteed at present.</div>
<div>For the third one, I am hesitating, because I do not know much about <span style><font color="#222222" face="arial, sans-serif">Contraction Hierarchies Algorithm. I scanned its source code and it looks like it is not an easy one. I am not sure if it can be done in time.</font></span></div>
<div><br></div><div>I want to get your suggestions on which one will be the best topic and then I can start the proposal shortly.</div><div><br></div><div>Thanks,</div><div>Jinfu</div><div><br><div class="gmail_quote">On Wed, Apr 4, 2012 at 8:03 AM, Stephen Woodbridge <span dir="ltr"><<a href="mailto:woodbri@swoodbridge.com">woodbri@swoodbridge.com</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Hello GSoC candidates,<br>
<br>
We are hoping that some students are applying for GSoC for the pgRouting project. Time is very short to get your student applications! Both Danial and I are ready and willing to be Mentors.<br>
<br>
-Steve<br>
<br>
-------- Original Message --------<br>
Hello all,<br>
<br>
time is getting short for students applications, and we only have few<br>
proposals so far.<br>
<br>
Students, please prepare with your mentors the first draft of the<br>
proposal and submit it on Melange as soon as possible. I'd suggest to<br>
avoid last minute submissions, as the site will be presumably<br>
overloaded!<br>
<br>
Proposals can be edited until the deadline, April 6th 19:00 UTC so in<br>
about 2 days, 11 hours from now.<br>
<br>
You can use the date command to get the deadline for your timezone:<br>
<br>
date --date='TZ="UTC" 19:00 next Fri'<br>
<br>
or open the Melange homepage, where there is a countdown.<br>
<br>
Also, we hope that Geoserver, Mapserver, OSSIM... will participate<br>
this year. Let me know if there are any issues with applications and<br>
registration.<br>
<br>
Looking forward to see many good proposals!<br>
<br>
Anne<span class="HOEnZb"><font color="#888888"><br>
-- <br>
OSGeo GSoC Administrator<br>
<br>
</font></span><br>_______________________________________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org">pgrouting-dev@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/mailman/listinfo/pgrouting-dev</a><br>
<br></blockquote></div><br></div>