CMSC 471 Fall 2002 Class #5-6 – Monday, September 16 / Wednesday, September 18.
Chapter 4 Partition I. Covering and Dominating. Unit Disk Covering Given a set of n points in the Euclidean plane, find the minimum number of unit disks.
Hansons Market Scoring Rules Robin Hanson, Logarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation, 2002. Robin Hanson, Combinatorial.
Exploring the border between P and NP Uriel Feige Weizmann Institute 1.
A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions Tzvika Hartman Weizmann Institute.
Informed Search Chapter 4 Adapted from materials by Tim Finin, Marie desJardins, and Charles R. Dyer CS 63.
Lecture26
A FAST FAULT TOLERANT PARTITIONING ALGORITHM FOR WIRELESS SENSOR NETWORKS
Technical Dictionary
Introduction to complex systems and social network analysis
Counting Independent Sets using BP for Sparse Graphs ...
Distributed approximate spectral clustering for large scale datasets
