Theoretical Computer Science Stack Exchange

-2

votes

0

answers

26

views

The maximum-weight subgraph problem, NP-hard? approximation?

np-hardness approximation

modified yesterday Tomlin 2

12

votes

3

answers

844

views

Edge-partitioning cubic graphs into claws and paths

cc.complexity-theory graph-theory np-hardness co.combinatorics

modified 2 days ago Glorfindel 157

-2

votes

0

answers

22

views

Complexity of a Subset Sum variant with target dependent on elements

cc.complexity-theory reference-request np-hardness

modified 2 days ago CRD 1

3

votes

0

answers

62

views

Is monotone 1-in-3 MAXSAT known to be APX hard?

np-hardness sat approximation-hardness

modified Feb 16 at 1:49 karmanaut 465

0

votes

0

answers

22

views

Computing a sum of products of ratios of QAP-like functions

np-hardness

asked Feb 13 at 3:35 passerby51 158

6

votes

3

answers

220

views

A partition problem in which some numbers may be cut

np-hardness reductions partition-problem

modified Feb 6 at 20:02 Chao Xu 2,914

6

votes

1

answer

150

views

Minimal generator for a set of sets

reference-request np-hardness set-cover

answered Feb 1 at 12:26 user6192 71

4

votes

1

answer

56

views

Solving an LP with at most m-1 nonzeros

np-hardness linear-programming

answered Jan 27 at 6:29 Erel Segal-Halevi 878

3

votes

0

answers

123

views

Random self reducibility and NP

np-hardness complexity-classes reductions

modified Jan 24 at 4:26 user30448 129

9

votes

1

answer

155

views

Edge-partitioning into rainbow triangles

graph-theory np-hardness

answered Jan 18 at 9:08 Mikhail Rudoy 2,308

9

votes

1

answer

368

views

Does 1-in-3 SAT remain NP-hard even if every variable occurs both positively and negatively?

cc.complexity-theory np-hardness sat

answered Jan 17 at 10:39 Mikhail Rudoy 2,308

0

votes

2

answers

207

views

NP-hard problems on the class of caterpillars

np-hardness np-complete

modified Jan 16 at 9:40 Marzio De Biasi 18.4k

20

votes

4

answers

1k

views

Positive topological ordering, take 3

ds.algorithms np-hardness open-problem matrices

answered Jan 14 at 17:04 ORILL_Code 1

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

The maximum-weight subgraph problem, NP-hard? approximation?

Edge-partitioning cubic graphs into claws and paths

Complexity of a Subset Sum variant with target dependent on elements

Is monotone 1-in-3 MAXSAT known to be APX hard?

Computing a sum of products of ratios of QAP-like functions

A partition problem in which some numbers may be cut

Minimal generator for a set of sets

Solving an LP with at most m-1 nonzeros

Random self reducibility and NP

Edge-partitioning into rainbow triangles

Does 1-in-3 SAT remain NP-hard even if every variable occurs both positively and negatively?

NP-hard problems on the class of caterpillars

Positive topological ordering, take 3

Best polynomial-time approximation factor for NP-optimization problems

Hot Network Questions