The top documents tagged [maximum independent]

Problem Setting :Influence Maximization A new product is available in the market. Whom to give free samples to maximize the purchase of the product ? 1
Documents Problem Setting :Influence Maximization A new product is available in the market. Whom to give free samples to maximize the purchase of the product ? 1

231 views

CS240A: Computation on Graphs. Graphs and Sparse Matrices 1 1 1 2 1 1 1 3 1 1 1 4 1 1 5 1 1 6 1 1 1 2 3 4 5 6 3 6 2 1 5 4 Sparse matrix is a representation
Documents CS240A: Computation on Graphs. Graphs and Sparse Matrices 1 1 1 2 1 1 1 3 1 1 1 4 1 1 5 1 1 6 1 1 1 2 3 4 5 6 3 6 2 1 5 4 Sparse matrix is a representation

215 views

Chapter 6 Matching. 2 6.1 SYSTEMS OF DISTINCTRE PRESENTATIVES
Documents Chapter 6 Matching. 2 6.1 SYSTEMS OF DISTINCTRE PRESENTATIVES

217 views

Designing Oracles for Grover Algorithm. Homework 1.You have time until December 3 to return me this homework. 2.Please use PPT, Word or some word processor
Documents Designing Oracles for Grover Algorithm. Homework 1.You have time until December 3 to return me this homework. 2.Please use PPT, Word or some word processor

214 views

Www.cs.technion.ac.il/~reuven 1 Seminar 236803: Approximation algorithms for LP optimization problems Reuven Bar-Yehuda Technion IIT Slides and paper at:
Documents Www.cs.technion.ac.il/~reuven 1 Seminar 236803: Approximation algorithms for LP optimization problems Reuven Bar-Yehuda Technion IIT Slides and paper at:

218 views

Theta Function Lecture 24: Apr 18. Error Detection Code Given a noisy channel, and a finite alphabet V, and certain pairs that can be confounded, the
Documents Theta Function Lecture 24: Apr 18. Error Detection Code Given a noisy channel, and a finite alphabet V, and certain pairs that can be confounded, the

214 views

1 TDMA Scheduling in Competitive Wireless Networks Mario CagaljHai Zhan EPFL - I&C - LCA February 9, 2005
Documents 1 TDMA Scheduling in Competitive Wireless Networks Mario CagaljHai Zhan EPFL - I&C - LCA February 9, 2005

214 views

1 Graphs with tiny vector chromatic numbers and huge chromatic numbers Michael Langberg Weizmann Institute of Science Joint work with U. Feige and G. Schechtman
Documents 1 Graphs with tiny vector chromatic numbers and huge chromatic numbers Michael Langberg Weizmann Institute of Science Joint work with U. Feige and G. Schechtman

224 views

+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks
Documents + Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks

218 views

1 Smoothed Analysis of Algorithms Shang-Hua Teng Boston University Akamai Technologies Inc Joint work with Daniel Spielman (MIT)
Documents 1 Smoothed Analysis of Algorithms Shang-Hua Teng Boston University Akamai Technologies Inc Joint work with Daniel Spielman (MIT)

219 views

Discovering Treewidth Hans L. Bodlaender, Utrecht University
Documents Discovering Treewidth Hans L. Bodlaender, Utrecht University

216 views

The Grammar According to West math.uiuc/~west/grammar.html
Documents The Grammar According to West math.uiuc/~west/grammar.html

62 views