Explore our questions

0 votes
0 answers
31 views

Bipartite Matching with a Partition Constraint over the Vertices

5 votes
3 answers
15k views

what is the real difference between traveling salesman problem (TSP) and vehicle routing problem (VRP)?

13 votes
0 answers
628 views

Recent progress on the next-to-shortest-path problem for directed graphs?

0 votes
1 answer
79 views

Polynomial time algorihtms for two variants of the decision version of longest walk problem

0 votes
2 answers
84 views

strong NP-completeness of multi-dimensional Equal-Subset-Sum

1 vote
1 answer
60 views

Shorter than target vector path algorithm

0 votes
0 answers
44 views

Unbounded Knapsack: Does Increasing capacity increase optimal value?

4 votes
3 answers
287 views

A Travelling Salesman variant where the next distance depends on distance travelled so far

12 votes
2 answers
690 views

Problems that are NP-Complete when restricted to graphs of treewidth 2 but polynomial on trees

0 votes
2 answers
212 views

Shortest path with permutations and fixed dimension

5 votes
1 answer
132 views

Shortest path with affine updates and fixed dimension

16 votes
3 answers
5k views

Subset sum vs. Subset product (strong vs. weak NP hardness)

25 votes
2 answers
2k views

Is finding Logspace reductions harder than P reductions?

1 vote
0 answers
143 views

Reordering a DAG with the minimum changes

Browse more Questions