Algorithm Design

Kleinberg, J., & Éva Tardos, A. D. (2006). Algorithm Design. Pearson.

Type

Book chapter

Intellectual base

Textbook

Year

2006

ISBN

9780321295354

Link

https://www.pearson.com/en-us/subject-catalog/p/algorithm-design/P200000003259

Cited from

operations_research

Cited by

3 citations across 3 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Dynamic Programming
  • This clarity enables both rigorous complexity analysis (time is O(states × transitions)) and a standardized implementation workflow (identify state, write recurrence, choose top-down or bottom-up, fill table, traceback).

    This sourceStandard algorithms textbook: presents DP as a unifying design technique with optimal substructure and overlapping subproblems as the two structural conditions for tractability

Domain-specific

• Divide-and-conquer algorithm
  • The entry concerns the algorithm-design paradigm; correctness, speedup, parallelism, and locality must be proved separately for each instantiation.
• Multi-commodity flow problem
  • … share a bottleneck edge; feasible routing may split one demand over alternate paths so their combined bottleneck load does not exceed capacity. to A traffic-engineering optimizer minimizes maximum link utilization across many origin-destination demands while preserving demand balance and router path constraints..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:78406071952b · see in the full table