Skip to main content

Explore our questions

1 vote
0 answers
123 views

Is finding the best permutation an NP-Complete problem?

0 votes
0 answers
25 views

Efficient PTAS for 2 identical knapsacks?

2 votes
1 answer
120 views

Approximating the utilitarian welfare minus a constant

9 votes
1 answer
335 views

Positive cut algorithm on bipartite graphs with negative weights

17 votes
2 answers
621 views

Can we approximate the number of words accepted by an NFA?

13 votes
4 answers
836 views

A Multi-cut Problem

1 vote
3 answers
125 views

Stable/Robust Traveling Salesman Approximation Methods

2 votes
0 answers
56 views

Do prefix hash functions work well for approximate counting?

1 vote
0 answers
56 views

Is the Maximum Coverage Problem Remains as Hard when Taking Most Sets?

3 votes
0 answers
52 views

Partial Hamiltonian Path Optimization Problem

0 votes
2 answers
406 views

A k-approximation to k-way number partitioning

3 votes
1 answer
115 views

How well can shortest common supersequence over small alphabet size be approximated?

0 votes
0 answers
53 views

Shortest sequence that contains a given list of sequences as subsequences

2 votes
0 answers
76 views

References for algorithms to compute approximating polytopes for arbitrary convex sets

Browse more Questions