IgnouGroup Social Campus
Problem Detail: I have a variant of bidding problem at hand. There are N bidders(~20) who bid for items from a pool of many items(~10K). Each bidder can bid many items. I want to maximize the number of bidders who are Read More …
Problem Detail: Here is the question: I have a given tree with n nodes. The task is to find the number of subtrees of the given tree with outgoing edges to its complement less than or equal to a given number Read More …
Problem Detail: I’m working on a simple project of software engineering that should combine two patterns. I choose Abstract Factory and Decorator patterns to modify (dynamically) objects created with the concrete Factory classes. My question is: is delegating object decorations to Read More …
Problem Detail: e.g. $xy+x+y=x+y(x+1)$ ? The expressions are from ordinary high-school algebra, but restricted to arithmetic addition and multiplication (e.g. $2+2=4; 2.3=6$), with no inverses, subtraction or division. Letters are variables. If it helps, we can forbid any expression representable with Read More …
Problem Detail: I’m trying to reduce an optimization problem to a decision problem, more specifically, consider the Max-Cut problem in its decision version: Given $(G=(V,E),k)$ as input, where $G$ is an undirected weighted graph (all weights are positive integers, formally: $w: Read More …
Problem Detail: I was fooling around with Google Blocky’s Maze demo, and remembered the old rule that if you want to solve a maze, just keep your left hand to the wall. This works for any simple-connected maze and can be Read More …
Problem Detail: It is proven by Time hierarchy theorem that EXPTIME-complete do not belong to P even if we do not know if NP belong to P. Before I read wiki, I found EXPTIME algorithm for solving 3-sat, the brute algorithm Read More …
Problem Detail: Given weighted directed graph $G = (V,E,w)$, where $w : E to mathbb R^+$ source vertex $v in V$ vertex subset $U subset V$ how to find a shortest directed path from $v$ containing all vertices from $U$? Note Read More …
Problem Detail: I have a list and want to select a random item from the list. An algorithm which is said to be random: When you see the first item in the list, you set it as the selected item. When Read More …
Problem Detail: I just wrote a program that runs the Travelling Salesman Problem using the Nearest Neighbor Algorithm. Afterwards, I started looking into Minimum Spanning Trees (MST). From my understanding: The Nearest Neighbor Algorithm traverses a graph starting at one vertex, Read More …
