Remember
Register
Algorithms Q&A
Smart HCM Software
Get the course textbook
Questions
Unanswered
Ask a Question
Lecture Notes
Not Exponential, on Twitter
All categories
Asymptotic Analysis
(22)
Divide & Conquer
(9)
Greedy Algorithms
(2)
Dynamic Programming
(7)
Backtracking/DFS/BFS
(2)
Branch & Bound
(2)
Graph Theory
(15)
NPCompleteness
(4)
Recent questions and answers in Branch & Bound
Most popular tags
timecomplexity
asymptoticnotation
recurrencerelations
loops
graph
asymptoticanalysis
dynamicprogramming
analysis
vertexcoloring
greedy
log
exponent
mvcs
npcompleteness
mastertheorem
smalloh
nestedloops
sortedlists
example
recursive
graphcoloring
randomgraphgeneration
proxy
network
substitutionmethod
branchandbound
d&c
degreeconstrained
spanningtree
vertexcover
reduction
dfs
subtree
primenumbers
sqrt
lecture1
math
tree
count
minimize
floors
array
median
knapsack
trichotomy
eggs
searching
function
relation
gcd
tetris
Recent questions and answers in Branch & Bound
+1
vote
1
answer
The lower bound for the Traveling Salesman Problem
answered
Dec 5, 2016
in
Branch & Bound
by
taoran_xue
Active
(
276
points)
branchandbound
+1
vote
1
answer
Employee to project assignment reward problem
answered
Dec 5, 2016
in
Branch & Bound
by
Fangfei
(
200
points)
Help get things started by
asking a question
.
The Book: Analysis and Design of Algorithms

Presentations on Slideshare

Lecture Notes, etc
...