StringologyTimes

Data Structures and Algorithms: 2008/6/22-28

1: Approximating Multi-Criteria Max-TSP
2: Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths
3: A comparison of two approaches for polynomial time algorithms computing basic graph parameters
4: Space Efficient Multi-Dimensional Range Reporting
5: The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph
6: A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability