Bangye's user avatar
Bangye's user avatar
Bangye's user avatar
Bangye
  • Member for 10 years, 1 month
  • Last seen more than 3 years ago
3 votes

Efficiently calculating the minimum distance for TSP

3 votes

For a graph to be connected, you need at least n-1 edges rigorous proof

3 votes

Does a greedy task selection algorithm find a c-approximate solution?

3 votes

How to choose the maximum number of nodes (with constraints) from a graph

3 votes

Reducing Exact Cover to Subset Sum

3 votes
Accepted

Number and probability of random allocations of n processes to n servers

2 votes
Accepted

Algorithms: Difference Constraints

2 votes

Find a MST such that it's mostly red (original graph's edges are colored red and blue)

2 votes

Applications of Depth-First Spanning Tree

2 votes

Mininun changes required in a directed graph to make path from 1 to n

1 vote

Minimizing the following objective function with matrices

1 vote
Accepted

Algorithm that finds concise representations of sets of pairs using Cartesian products

1 vote

Testing the property of being a union of three disjoint cliques

1 vote

Find the minimum set of intervals for given set of numbers

1 vote

Calculating unbalanced binary trees

0 votes

Is the Weighted Maximum Coverage Problem with frequency weights NP-hard?

0 votes

Time-complexity of recursive defined code

-1 votes

Finding the kth element of a permutation

-1 votes

Is it NP hard to decide whether there exists a subset of V of size at most $k$ hitting all maximal bicliques of G?

-1 votes

Complexity of a knapsack variant