Concepedia

Chris Harrelson

CH

6

Publications

1.1K

Citations

6

H-Index

2003

Active since

Affiliations

Berkeley College(Current)

Kasetsart University

Chris Harrelson is an author at Berkeley College specializing in engineering, combinatorial optimization, and computer science.

Top concepts

EngineeringComputer ScienceComputational ComplexityCombinatorial OptimizationGraph TheoryDiscrete MathematicsApproximation TheoryMathematical ProgrammingBusinessPath Problems

Publications per year

2003–2007

6

Publications

6

Computing the shortest path: A search meets graph theory

Andrew V. Goldberg, Chris Harrelson · Symposium on Discrete Algorithms · 2005 · 725 citations

Mathematical Programming, Engineering, Shortest Path Algorithms +16

A polynomial-time tree decomposition to minimize congestion

Chris Harrelson, Kirsten Hildrum, Satish Rao · 2003 · 120 citations

Computational Complexity Theory, Engineering, Computational Complexity +18

The <i>k</i> -traveling repairmen problem

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao · ACM Transactions on Algorithms · 2007 · 68 citations

Engineering, Computational Complexity, Minimum Latency Problem +17

The k-traveling repairman problem

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao · Symposium on Discrete Algorithms · 2003 · 63 citations

Mathematical Programming, Engineering, Computational Complexity +19

An improved approximation algorithm for the 0-extension problem

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao et al. · Symposium on Discrete Algorithms · 2003 · 50 citations

Mathematical Programming, Numerical Analysis, Branch-and-bound Algorithm +19

Rows per page

1–5 of 6