User Rohit Pandey

6 votes

1 answer

599 views

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

asked Apr 16, 2022 at 21:36

4 votes

2 answers

459 views

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

asked Mar 21, 2021 at 20:32

4 votes

2 answers

196 views

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

asked Oct 25, 2020 at 7:27

2 votes

1 answer

272 views

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

asked Nov 22, 2020 at 7:57

2 votes

1 answer

540 views

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

asked Nov 27, 2020 at 9:03

2 votes

1 answer

76 views

Hungarian method: seemingly different algorithms from different sources?

asked Nov 27, 2020 at 17:52

2 votes

1 answer

160 views

How to define a path between two sets of vertices?

asked Nov 30, 2020 at 7:31

2 votes

3 answers

335 views

FFT algorithm for arbitrary $n$

asked Nov 20, 2022 at 2:45

2 votes

2 answers

124 views

Prove that balanced binary search tree has lowest expected cost

asked Feb 26 at 1:39

1 vote

1 answer

67 views

Minimum coins to make change when real numbers are allowed

asked Jun 14, 2023 at 7:43

1 vote

0 answers

47 views

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

asked Dec 18, 2022 at 4:30

1 vote

1 answer

90 views

Triangles covering all vertices of a tri-partite graph

asked Jan 25, 2021 at 2:43

1 vote

1 answer

124 views

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

asked Nov 27, 2020 at 4:35

1 vote

1 answer

511 views

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

asked Oct 31, 2020 at 20:14

1 vote

0 answers

114 views

Min weighted path in a graph, but you could die

asked Mar 21, 2022 at 5:50

1 vote

1 answer

132 views

Dual of a graph where the faces are unclear

asked Apr 30, 2022 at 8:21

0 votes

1 answer

60 views

Construct an objective function that favors the sorted permutation

asked Oct 2, 2022 at 18:41

0 votes

1 answer

45 views

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

asked Oct 2, 2022 at 23:42

0 votes

2 answers

170 views

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

asked Oct 15, 2022 at 21:28

0 votes

1 answer

864 views

Traveling salesman problem on an incomplete graph

asked Nov 6, 2022 at 19:52

0 votes

0 answers

425 views

Max flow but distribute evenly among candidate vertices

asked Oct 11, 2020 at 20:41

0 votes

1 answer

48 views

Path connecting certain vertices in a neural graph

asked Jun 28, 2021 at 0:19

0 votes

2 answers

487 views

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

asked Mar 6, 2021 at 20:01

0 votes

1 answer

75 views

Is the traveling salesman on a map NP-hard?

asked Jan 9, 2023 at 0:49

0 votes

1 answer

188 views

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

asked Nov 24, 2022 at 22:32

0 votes

1 answer

44 views

Regular branch and bound vs integer programming branch and bound

asked Mar 10 at 5:19

Stack Exchange Network

26 Questions

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

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

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

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

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

Hungarian method: seemingly different algorithms from different sources?

How to define a path between two sets of vertices?

FFT algorithm for arbitrary $n$

Prove that balanced binary search tree has lowest expected cost

Minimum coins to make change when real numbers are allowed

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

Triangles covering all vertices of a tri-partite graph

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

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

Min weighted path in a graph, but you could die

Dual of a graph where the faces are unclear

Construct an objective function that favors the sorted permutation

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

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

Traveling salesman problem on an incomplete graph

Max flow but distribute evenly among candidate vertices

Path connecting certain vertices in a neural graph

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

Is the traveling salesman on a map NP-hard?

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

Regular branch and bound vs integer programming branch and bound