Theoretical Computer Science Stack Exchange

-1

votes

0

answers

16

views

Is this a correct way to prove the inapproximability of general k-center?

approximation-algorithms approximation-hardness

modified yesterday Pareod 1

-1

votes

0

answers

50

views

Is there any approximation factor for this algorithm?

approximation-algorithms approximation

modified Feb 14 at 19:57 Payam Esfandiari 1

-1

votes

0

answers

16

views

Eigenvalues of almost Laplacian matrix, particular structure

graph-algorithms co.combinatorics approximation-algorithms

asked Feb 12 at 18:54 user6458 1

7

votes

1

answer

101

views

Smoothed analysis to compare algorithms

ds.algorithms approximation-algorithms smoothed-analysis

answered Feb 11 at 11:40 Bodo Manthey 355

5

votes

1

answer

310

views

Do combinatorial discrepancy upper bounds lead to smaller $\epsilon$-nets (as with $\epsilon$-samples)?

cg.comp-geom approximation-algorithms vc-dimension

modified Feb 11 at 8:46 Jan Johannsen 3,874

0

votes

0

answers

43

views

$k$th element in data stream

approximation-algorithms streaming-algorithms

modified Feb 11 at 8:45 Jan Johannsen 3,874

44

votes

4

answers

11k

views

Approximation algorithms for Metric TSP

cc.complexity-theory graph-algorithms approximation-algorithms tsp exp-time-algorithms

modified Jan 25 at 3:01 Alex Golovnev 1,263

-1

votes

0

answers

33

views

where extreme Daubechies wavelet coeﬃcients would be useful?

approximation-algorithms optimization shannon-entropy

asked Jan 22 at 2:43 user124297 19

2

votes

0

answers

64

views

What is the competitive ratio of a $d$-way associative LRU cache?

ds.algorithms approximation-algorithms online-algorithms competitive-ratio

asked Jan 14 at 20:34 R B 6,288

2

votes

1

answer

89

views

Maximum-minimum satisfiability

approximation-algorithms optimization sat

answered Jan 9 at 20:43 james 36

3

votes

2

answers

105

views

Minimum relevant variables in linear system - additive approximation

approximation-algorithms optimization linear-programming approximation-hardness

answered Jan 9 at 20:24 Sasho Nikolov 16.2k

17

votes

3

answers

431

views

Is there a constant factor approximation algorithm for 2D rectangle coloring problem?

ds.algorithms approximation-algorithms cg.comp-geom graph-colouring online-algorithms

modified Jan 7 at 8:34 Glorfindel 157

2

votes

0

answers

151

views

Best polynomial-time approximation factor for NP-optimization problems

cc.complexity-theory np-hardness approximation-algorithms approximation-hardness

asked Jan 5 at 16:54 Andras Farago 5,609

6

votes

0

answers

108

views

Grid-Minor Theorem of Robertson and Seymour and its Algorithmic Applications

graph-algorithms approximation-algorithms treewidth graph-minor

asked Jan 4 at 9:44 Rupei Xu 1,065

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

Is this a correct way to prove the inapproximability of general k-center?

Is there any approximation factor for this algorithm?

Eigenvalues of almost Laplacian matrix, particular structure

Smoothed analysis to compare algorithms

Do combinatorial discrepancy upper bounds lead to smaller $\epsilon$-nets (as with $\epsilon$-samples)?

$k$th element in data stream

Approximation algorithms for Metric TSP

where extreme Daubechies wavelet coeﬃcients would be useful?

What is the competitive ratio of a $d$-way associative LRU cache?

Maximum-minimum satisfiability

Minimum relevant variables in linear system - additive approximation

Is there a constant factor approximation algorithm for 2D rectangle coloring problem?

Best polynomial-time approximation factor for NP-optimization problems

Grid-Minor Theorem of Robertson and Seymour and its Algorithmic Applications

Hot Network Questions