I had a problem in my class quiz to write a non determinstic algorithm for Vertex Cover. We discussed about the solution with our instructor and he told that the level indeterminancy should not be too high. It should be sensibly good.
I am confused about what question should I ask to non-deterministic computer ?
Non-Deterministic Algorithm for Vertex Cover
805 Views Asked by Laschet Jain At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- Getting started: where should I write the program?
- how to minimize the number of instances of a literal, in clingo 4.5
- ASP Clingo - splitting graph to n cliques
- problems generating interval information
- asp (clingo) : why are ordered sums not working
- how to use forall X in answer set programming (dlv) (answer set prolog)
- Answer Set Programming - How to count number of facts appears to be my query result?
- sbass unable to read gringo output
- answer set programming with recursion
- Sudoku in Clingo
Related Questions in NON-DETERMINISTIC
- Getting started: where should I write the program?
- how to minimize the number of instances of a literal, in clingo 4.5
- ASP Clingo - splitting graph to n cliques
- problems generating interval information
- asp (clingo) : why are ordered sums not working
- how to use forall X in answer set programming (dlv) (answer set prolog)
- Answer Set Programming - How to count number of facts appears to be my query result?
- sbass unable to read gringo output
- answer set programming with recursion
- Sudoku in Clingo
Related Questions in VERTEX-COVER
- Getting started: where should I write the program?
- how to minimize the number of instances of a literal, in clingo 4.5
- ASP Clingo - splitting graph to n cliques
- problems generating interval information
- asp (clingo) : why are ordered sums not working
- how to use forall X in answer set programming (dlv) (answer set prolog)
- Answer Set Programming - How to count number of facts appears to be my query result?
- sbass unable to read gringo output
- answer set programming with recursion
- Sudoku in Clingo
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The obvious question is "which vertex next"?
A simple greedy approximation algorithm for vertex cover repeatedly chooses the vertex with the most uncovered adjacent vertices.
A simple non-deterministic approximation algorithm for vertex cover repeatedly chooses the next vertex randomly, but with the probability assigned to each vertex proportional to its number of uncovered adjacent vertices. Do that over and over again, remembering the best solution so far.