User Laakeri

12

votes

0

answers

661

views

Optimal meeting point in directed graph

Jul 20 '18 at 21:04 koverman47 238

9

votes

1

answer

130

views

Generate random labeled tree with constrained edge lengths

algorithms graphs trees

Nov 5 '19 at 15:30 Richard Futrell 121

9

votes

3

answers

296

views

Test if there exists an integer k to add to one sequence to make it a subsequence of another sequence

algorithms integers subsequences

Dec 3 '19 at 5:46 HEKTO 2,610

9

votes

1

answer

258

views

2D interval scheduling problem

algorithms optimization approximation scheduling intervals

Apr 7 '20 at 21:06 taktoa 266

8

votes

0

answers

128

views

Compute the expected size of an approximation of vertex cover

graphs approximation probability-theory randomized-algorithms vertex-cover

Feb 9 '20 at 13:05 narek Bojikian 3,783

6

votes

2

answers

136

views

Algorithm for finding “mean center” of unweighted graph

Apr 9 '20 at 17:46 j_random_hacker 4,435

4

votes

1

answer

183

views

Search for maximal value smaller than V in an array composed of K linear functions

algorithms data-structures search-algorithms

Jan 12 '20 at 15:02 John L. 25k

4

votes

0

answers

115

views

Is there a data structure that can perform range modulo additions and range minimum queries?

algorithms data-structures

Jan 5 '20 at 11:51 shgr1092 92

4

votes

0

answers

114

views

Perfect Halver Construction?

sorting circuits

Nov 5 '19 at 2:50 Mark 288

4

votes

1

answer

52

views

Count bridging edges in a family of two component forests

graphs spanning-trees

Apr 1 '20 at 19:04 j_random_hacker 4,435

4

votes

0

answers

83

views

Expected search times with quadratic vs linear probing

hashing

Apr 13 at 14:43 Amelio Vazquez-Reina 407

4

votes

2

answers

218

views

How can you compute the expected edit distance in $O(2^{3n/2})$ time?

algorithms dynamic-programming strings

Feb 3 '20 at 20:53 j_random_hacker 4,435

4

votes

2

answers

293

views

Polynomial-time linear-reduction from Directed Hamiltonian Path Problem to 3SAT

complexity-theory time-complexity np-complete reductions satisfiability

Mar 2 at 7:28 Andrew Johnson 11

3

votes

2

answers

288

views

Smallest $s$-component in mincut

network-flow minimum-cuts

Dec 2 '19 at 17:23 D.W.♦ 129k

3

votes

1

answer

107

views

Given n sorted arrays with size k select one element from every array such that the sum of the elements is minimum and the sum of their indices is k+1

sorting dynamic-programming

Dec 25 '19 at 2:38 Antti Röyskö 1,036

2

votes

2

answers

223

views

What goes into proving two complicated programs are equivalent?

reference-request proof-techniques model-checking research

Dec 25 '19 at 23:37 goofy 146

2

votes

0

answers

45

views

Algebraic Dynamic Programming breakdown of a simple problem (e.g. climbing staircase)

dynamic-programming

Jan 27 '20 at 10:20 Hi-Angel 121

2

votes

0

answers

23

views

FPTAS algorithm to find flow at each link for multi commodity flow problem?

algorithms graphs np-complete approximation network-flow

Jan 27 '20 at 12:42 narek Bojikian 3,783

1

vote

1

answer

83

views

Selection over combinatorics that satisfies a distribution

algorithms combinatorics constraint-satisfaction set-cover selection-problem

Feb 15 '20 at 1:41 narek Bojikian 3,783

1

vote

0

answers

14

views

What is known about this independent set generalisation?

graphs

Jul 10 at 12:45 FUZxxl 816

1

vote

0

answers

31

views

Randomized version of the class $APX$?

reference-request approximation randomized-algorithms definitions

Nov 10 '19 at 3:46 Lorenzo Najt 364

1

vote

1

answer

84

views

Is SEMIPRIME in P?

complexity-theory reference-request primes

Oct 25 at 2:05 Community♦ 1

1

vote

0

answers

23

views

Number of ways to pass edges of a cycle exactly n times [closed]

algorithms combinatorics

Dec 26 '19 at 21:28 grescha 43

1

vote

2

answers

695

views

Is there an algorithm to find all connected sub-graphs of size K?

graphs

Nov 15 at 14:02 Yann 21

1

vote

0

answers

36

views

Shortest path in directed graph passing thru specific vertices

algorithms graphs

Jan 24 '20 at 11:28 Guy Berkovitz 31

0

votes

0

answers

53

views

Designing an algorithm: arrange rectangles of varying sizes, in a pre-defined order, into an approximate box

algorithms

Nov 10 '19 at 3:47 Aze 1

0

votes

0

answers

100

views

A sort of job scheduling problem

algorithms reference-request

Jan 10 '20 at 18:31 xskxzr 6,539

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

27 Bookmarks

Optimal meeting point in directed graph

Generate random labeled tree with constrained edge lengths

Test if there exists an integer k to add to one sequence to make it a subsequence of another sequence

2D interval scheduling problem

Compute the expected size of an approximation of vertex cover

Algorithm for finding “mean center” of unweighted graph

Search for maximal value smaller than V in an array composed of K linear functions

Is there a data structure that can perform range modulo additions and range minimum queries?

Perfect Halver Construction?

Count bridging edges in a family of two component forests

Expected search times with quadratic vs linear probing

How can you compute the expected edit distance in $O(2^{3n/2})$ time?

Polynomial-time linear-reduction from Directed Hamiltonian Path Problem to 3SAT

Smallest $s$-component in mincut

Given n sorted arrays with size k select one element from every array such that the sum of the elements is minimum and the sum of their indices is k+1

What goes into proving two complicated programs are equivalent?

Algebraic Dynamic Programming breakdown of a simple problem (e.g. climbing staircase)

FPTAS algorithm to find flow at each link for multi commodity flow problem?

Selection over combinatorics that satisfies a distribution

What is known about this independent set generalisation?

Randomized version of the class $APX$?

Is SEMIPRIME in P?

Number of ways to pass edges of a cycle exactly n times [closed]

Is there an algorithm to find all connected sub-graphs of size K?

Shortest path in directed graph passing thru specific vertices

Designing an algorithm: arrange rectangles of varying sizes, in a pre-defined order, into an approximate box

A sort of job scheduling problem