Unanswered Questions
3,747 questions with no upvoted or accepted answers
-1
votes
1
answer
183
views
Will a non-linear lower bound on some NP complete problem prove non-linear lower bound on 3SAT?
A problem $\Pi$ is $\mathsf{NP}$ complete if there is a polynomial time reduction from an $\mathsf{NP}$ complete problem $\Pi^\circ$ to $\Pi$ with polynomial blow up on number of variables and ...
CommunityBot
- 1
-1
votes
1
answer
89
views
Find non-intersecting submatrices
I have a rectangular boolean matrix and I'd like to have an efficient algorithm to find non-intersecting submatrices. I'll to demonstrate that in the example below.
The ideal case is when all ...
- 511
-1
votes
1
answer
37
views
M/G/$\infty$ queue with mixture of deterministic service times
Hey guys I am studying queueing theory and I am trying to understand this problem. Consider an $M/GI/ \infty $ queue with the following service time distribution: the service time is $1/\mu_i$ with ...
- 245
-1
votes
1
answer
132
views
Combinatorial algorithm for load balancing
I have a problem that can be solved with linear programming, but I'm hoping there's a combinatorial algorithm for this (even approximation is fine).
This is basically a load balancing problem using ...
- 31
-1
votes
1
answer
173
views
NP Hardness of Metric Steiner Tree
It is known that the metric steiner tree problem is NP hard (Garry and Johnson [1977]). I wanted to know if there is a simpler way of proving the same. Specifically, I am trying to find a polynomial ...
- 864
-1
votes
1
answer
170
views
Representation suitable for reconstruction of a tree with bounded degree
I am dealing with reconstruction of molecular graphs for which unlabelled rooted trees with maximum degree 4 are fair approximations. In particular, I would like to encode a small tree (assume number ...
- 103
-1
votes
1
answer
2k
views
Time complexity analysis of random forest and k-means?
I am working with random forest for a supervised classification problem, and I am using the k-means clustering algorithm to split the data at each node, where
$n$ is the number of points,
$K$ is ...
CommunityBot
- 1
-1
votes
1
answer
205
views
Clustering without specifying the number of clusters apriori
Does anyone know of an algorithm that can perform the following tasks:
Unsupervised clustering without specifying the number of clusters apriori. For example if all the buildings in wide geographical ...
CommunityBot
- 1
-1
votes
1
answer
77
views
Find Combinations of fibonacci values to approximate a target value given $F(A,B,C,D) = (A + B + C) / D$
I am able to solve this using brute force but curious if there is a better approach.
Given the function $F(A,B,C,D) = (A + B + C) / D$ where each variable is in the first 7 distinct values of the ...
- 29.5k
-1
votes
1
answer
141
views
Parameters: Twin cover and Vertex cover
I am a research scholar, currently working on parameterized algorithms. I am working on a problem and have been exploring various parameters for which the problem remains unsolved. I have read the ...
- 2,816
-1
votes
1
answer
450
views
Canopy clustering: what should we do with samples in overlapping canopies?
In canopy clustering http://www.kamalnigam.com/papers/canopy-kdd00.pdf, if a sample falls in an overlap of 2 canopies, how do we choose its cluster?
- 661
-2
votes
0
answers
126
views
encoding a deterministic TM in SAT
Is it possible to encode the acceptance of a deterministic Turing Machine in a Satisfiablity CNF formula just like the Cook-Levin theorem does in $O(p(n)\log(p(n)))$ formula length (see wikipedia for ...
- 105
-2
votes
1
answer
79
views
Finding a greedy ordering criteria
I've been thinking through a problem, and I won't go into all the details here but I'm stumped on a particular subproblem:
Consider this following definition of a task: $T_k = (a_k, b_k)$. $a_k$ is ...
-2
votes
1
answer
85
views
Forming ordered pairs using monads and doing without the Kuratowski encoding of ordered pairs
Suppose we have a set $S$ of constants of the Simply-Typed Lambda Calculus (STLC) various types, and the operation of union $\cup$ which takes two constants and forms their union.
For example, $S$ ...
- 29.5k
-2
votes
1
answer
67
views
Assign each biclique to a distinct left
Given a minimum biclique edge cover, is it always possible to assign each biclique to a distinct left node (which it contains)?
ie one such assignment for this graph (from wikipedia): http://upload....
CommunityBot
- 1