Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs
Thomas Kalinowski's user avatar
Thomas Kalinowski's user avatar
Thomas Kalinowski's user avatar
Thomas Kalinowski
  • Member for 11 years, 1 month
  • Last seen more than a month ago
  • Mittweida, Germany
12 votes

What can be solved with semidefinite programming that can't be solved with linear programming?

11 votes

Number of vertices present in all maximum matchings

5 votes

Is the complexity of this covering problem known?

4 votes
Accepted

Travelling Salesman Problem where a subset of the nodes must be visited in a particular order

4 votes

network flow using minimum number of nodes

3 votes

Erdos conjecture, number of cliques, Turan`s graph

2 votes
Accepted

Scheduling to maximize idle time

1 vote

Check the match of the maximum of each subset

1 vote
Accepted

How to choose good diagonals when partitioning an orthogonal polygon into rectangles?

1 vote

Anyone recognize this as a special type of multi-commodity flow problem?

1 vote

Is there any reference on the hardness of approximation for 2-partition problem?