Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User taoran_xue
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(37)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Answers by taoran_xue
+1
vote
The lower bound for the Traveling Salesman Problem
answered
Dec 5, 2016
in
Branch & Bound
branchandbound
+2
votes
Topological Sort
answered
Dec 5, 2016
in
Backtracking/DFS/BFS
dfs
0
votes
Finding non-leaf node of a tree with no large subtrees
answered
Dec 5, 2016
in
Backtracking/DFS/BFS
tree
graph
subtree
+1
vote
MT for T(n) = 2T(n/2) + n^2 log n
answered
Sep 22, 2016
in
Asymptotic Analysis
master-theorem
recurrence-relations
+1
vote
Can T(n) = 2T(n/2) + nlogn use master theorem?
answered
Sep 21, 2016
in
Divide & Conquer
master-theorem
recurrence-relations
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc