Theoretical Computer Science Stack Exchange

0 votes

0 answers

39 views

Complexity of the distance between the average vector of two subsets

np-hardness approximation-algorithms

mathworker21

222

modified 18 hours ago

2 votes

1 answer

163 views

Maximize a special monotone submodular function - is it easier?

ds.algorithms co.combinatorics approximation-algorithms optimization fixed-parameter-tractable

Chandra Chekuri

6,650

modified May 14 at 15:22

0 votes

0 answers

63 views

Does the Christofides algorithm ensure this inequality?

graph-theory graph-algorithms approximation-algorithms metric-spaces

advocateofnone

129

modified Apr 23 at 1:33

0 votes

0 answers

30 views

Multi-dimensional 0-1 Knapsack problem with a high number of dimensions

ds.algorithms co.combinatorics approximation-algorithms

lchen

101

asked Apr 19 at 7:58

0 votes

1 answer

200 views

A k-approximation to k-way number partitioning

approximation-algorithms partition-problem

CommunityBot

1

modified Apr 18 at 16:03

12 votes

2 answers

3k views

Find all pairs of values that are close under Hamming distance

ds.algorithms co.combinatorics approximation-algorithms

Davide Fiocco

103

modified Mar 31 at 10:42

3 votes

0 answers

40 views

Online assignment lower bound results

approximation-algorithms lower-bounds gt.game-theory online-algorithms

Doc Stories

31

modified Mar 29 at 3:45

2 votes

1 answer

147 views

Another variation of $k$-means problem in the plane

ds.algorithms approximation-algorithms

Neal Young

8,133

modified Mar 23 at 21:46

0 votes

2 answers

212 views

Finding top-K items in a sliding window

approximation-algorithms sorting data-streams streaming-algorithms

CommunityBot

1

modified Mar 13 at 19:01

2 votes

0 answers

44 views

Existing results around approximation of minimum 2-edge connected Steiner subgraph

graph-theory approximation-algorithms parameterized-complexity

advocateofnone

129

modified Mar 1 at 21:38

4 votes

2 answers

209 views

Maximum Vertex Cover

approximation-algorithms greedy-algorithms vertex-cover

reservoir

89

answered Mar 1 at 10:36

5 votes

0 answers

113 views

Hashing-based vs almost uniform sampling-based approximate counting

approximation-algorithms counting-complexity randomized-algorithms approximation-hardness

user1271772

540

modified Jan 26 at 12:38

2 votes

0 answers

37 views

Is logarithmic additive approximation to bin covering possible?

approximation-algorithms packing covering-problems

Erel Segal-Halevi

1,826

modified Jan 19 at 3:13

-2 votes

1 answer

315 views

Find research partner (profession and beginner)

graph-theory graph-algorithms approximation-algorithms optimization se.software-engineering

Deepak kamalta

1

modified Jan 12 at 14:53

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Complexity of the distance between the average vector of two subsets

Maximize a special monotone submodular function - is it easier?

Does the Christofides algorithm ensure this inequality?

Multi-dimensional 0-1 Knapsack problem with a high number of dimensions

A k-approximation to k-way number partitioning

Find all pairs of values that are close under Hamming distance

Online assignment lower bound results

Another variation of $k$-means problem in the plane

Finding top-K items in a sliding window

Existing results around approximation of minimum 2-edge connected Steiner subgraph

Maximum Vertex Cover

Hashing-based vs almost uniform sampling-based approximate counting

Is logarithmic additive approximation to bin covering possible?

Find research partner (profession and beginner)

Hot Network Questions