Skip to main content
Rohit Pandey's user avatar
Rohit Pandey's user avatar
Rohit Pandey's user avatar
Rohit Pandey
  • Member for 5 years, 3 months
  • Last seen more than a month ago
0 votes
1 answer
42 views

Regular branch and bound vs integer programming branch and bound

2 votes
2 answers
106 views

Prove that balanced binary search tree has lowest expected cost

1 vote
1 answer
64 views

Minimum coins to make change when real numbers are allowed

0 votes
1 answer
72 views

Is the traveling salesman on a map NP-hard?

1 vote
0 answers
47 views

What algorithms apart from FFT get a computational boost by leveraging complex numbers?

0 votes
1 answer
173 views

Why does merge sort work for any $n$, but the basic FFT algorithm only for powers of $2$?

2 votes
3 answers
304 views

FFT algorithm for arbitrary $n$

0 votes
1 answer
784 views

Traveling salesman problem on an incomplete graph

0 votes
2 answers
168 views

Why can't we have P=NP but P not contained in NP-hard?

0 votes
1 answer
45 views

Examples of problems in NP but not in P which we haven't proved NP complete

0 votes
1 answer
55 views

Construct an objective function that favors the sorted permutation

1 vote
1 answer
129 views

Dual of a graph where the faces are unclear

6 votes
1 answer
590 views

What role is the set, S playing in Dijkstra's algorithm given in the book CLRS?

1 vote
0 answers
114 views

Min weighted path in a graph, but you could die

0 votes
1 answer
45 views

Path connecting certain vertices in a neural graph

4 votes
2 answers
442 views

Why does my code work: bijecting binary trees to Dyck paths

0 votes
2 answers
474 views

Assigning keys to the nodes of a Binary search tree given its shape

1 vote
1 answer
89 views

Triangles covering all vertices of a tri-partite graph

2 votes
1 answer
160 views

How to define a path between two sets of vertices?

2 votes
1 answer
72 views

Hungarian method: seemingly different algorithms from different sources?

2 votes
1 answer
489 views

Min weighted edge cover - is the greedy algorithm sub-optimal?

1 vote
1 answer
119 views

Concept of M-augmenting path to find a larger matching than $M$

2 votes
1 answer
263 views

Min weighted edge cover: don't follow proof in Schrijver

1 vote
1 answer
495 views

Min path cover problem in Cormen et.al. question about notation

4 votes
2 answers
193 views

Min path cover for a three-layer graph with all paths traversing all layers

0 votes
0 answers
402 views

Max flow but distribute evenly among candidate vertices