A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and

Source URL: theory.cs.uni-bonn.de

• Computational complexity theory
• Graph theory
• Mathematics
• NP-complete problems
• Steiner tree problem
• Approximation algorithm
• APX
• Spanning tree
• Optimization problem
• Wiener connector
• Travelling salesman problem

Quantified Constraints on Directed Graphs Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, U.K. Abstract We study the quantified H-colou

Source URL: www.bedewell.com

• Graph theory
• Mathematics
• Discrete mathematics
• NP-complete problems
• Morphisms
• Graph coloring
• Graph homomorphism
• Degree
• Line graph

Microsoft Word - 40Recs-2003-amend-Oct2004_en.doc

Source URL: www.nrb.org.np

• Economy
• Law
• Financial regulation
• Crime
• Terrorism
• Tax evasion
• Money laundering
• Bank regulation
• Financial Action Task Force on Money Laundering
• Politically exposed person
• Terrorism financing
• Payable-through account

Photo & Waiver Release International Water Institute River Watch Release Statements Please return this form to the International Water Institute, 650 NP Ave #110, Fargo, NDor provide to your River Watch IWI staff

Source URL: www.iwinst.org

• English grammar
• Shall and will
• Verbs

Max-Min Relations in Combinatorial Optimization Jos´e Soto October 6, 2010 Max-Min Relations in Combinatorial Optimization

Source URL: www.dim.uchile.cl

• Graph theory
• Mathematics
• NP-complete problems
• Bipartite graph
• Parity
• Matching
• Perfect graph
• Vertex cover

PDF Document

Source URL: www.lmtc.gov.np

Proceedings of the Eighth International Conference on Machine Learning and Cybernetics, Baoding, 12-15 JulySOLVING JAPANESE PUZZLES WITH LOGICAL RULES AND DEPTH FIRST SEARCH ALGORITHM MIN-QUAN JING, CHIUNG-HSUEH Y

Source URL: debut.cis.nctu.edu.tw

• Logic puzzles
• NP-complete problems
• Logic
• Mathematics
• Abstraction
• Nonogram
• Light Up
• Algorithm
• Sudoku solving algorithms
• Nurikabe

BOARD OF EDUCATION OF ANNE ARUNDEL COUNTY VOTES ON FISCAL YEAR 2012 ACTION ITEMS Supporting documents for agenda items can be found on Board Docs at www.aacps.org Y= IN FAVOR; N = OPPOSED; A = ABSTAIN; R = RECUSAL; NP =

Source URL: www.aacps.org

• Quantification
• Universal quantification
• Y

CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014

Source URL: theory.stanford.edu

• Computational complexity theory
• Theory of computation
• Operations research
• Complexity classes
• Combinatorial optimization
• Analysis of algorithms
• Knapsack problem
• Simplex algorithm
• Time complexity
• Optimization problem
• NP
• Polynomial-time approximation scheme

BASIS PURSUIT IN SENSOR NETWORKS João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 1 Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, USA 2

Source URL: users.isr.ist.utl.pt

• Mathematics
• Operations research
• Applied mathematics
• Combinatorial optimization
• Convex optimization
• Theoretical computer science
• Computer science
• A* search algorithm
• Algorithm
• NP
• Linear programming
• Belief propagation