CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

Source URL: stanford.edu

CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

Source URL: stanford.edu

• Combinatorial optimization
• Minimum spanning tree
• Spanning tree
• Job shop scheduling
• Maximum flow problem
• Max-flow min-cut theorem
• Cut
• Connectivity
• David Shmoys
• Graph theory
• Mathematics
• Theoretical computer science

MINIMUM REJECTION SCHEDULING IN ALL-PHOTONIC NETWORKS Nahid Saberi and Mark J. Coates Department of Electrical and Computer Engineering McGill University Montreal, QC, Canada E-mail: , coates@e

Source URL: www.tsp.ece.mcgill.ca

• Theoretical computer science
• Linear programming
• Scheduling
• Routing and wavelength assignment
• Mathematical optimization
• Max-min fairness
• Maximum flow problem
• Flow network
• Connectivity
• Operations research
• Mathematics
• Applied mathematics

FAIR MATCHING ALGORITHM: FIXED-LENGTH FRAME SCHEDULING IN ALL-PHOTONIC NETWORKS Nahid Saberi and Mark Coates Department of Electrical and Computer Engineering McGill University Montreal, QC, Canada

Source URL: www.tsp.ece.mcgill.ca

• Planning
• Management
• Business
• Operations research
• Max-min fairness
• Scheduling
• Fairness measure
• Bottleneck
• Routing and wavelength assignment
• Scheduling algorithms
• Routing algorithms
• Network performance

A Comparison between Time-slot Scheduling Approaches for All-Photonic Networks Xiao liu, Nahid Saberi, Mark J. Coates and Lorne G. Mason Department of Electrical Engineering McGill University 3480 University St, Montreal

Source URL: www.tsp.ece.mcgill.ca

• Electronics
• Network protocols
• Computer networking
• Fiber-optic communications
• Scheduling algorithms
• Virtual Output Queues
• Computer network
• Star network
• Optical burst switching
• Computing
• Network architecture
• Network topology

Asymptotic Behavior and Distributional Limits of Preferential Attachment Graphs Noam Berger∗ , Christian Borgs, Jennifer T. Chayes and Amin Saberi ∗ Mathematics Department, Hebrew University, Jerusalem 91904, Israel.

Source URL: research.microsoft.com

• Random graphs
• Preferential attachment
• Pseudoforest
• Planar separator theorem
• Graph theory
• Mathematics
• Stochastic processes

Understanding Frequent Hospitalisation of Older People (UFHOP) in Rural NSW Vahid Saberi, Geoff Morgan, Paul Corben, Dan Ewald, Lesley Barclay, Jo Longman, Kathy Heathcote, Yu Gao, Megan Passey, Vicki Rose, Funded by

Source URL: www.ruralheti.health.nsw.gov.au

• Health economics
• Medical terms
• Health care system
• Health policy
• Rural health
• Chronic
• Department of Health
• General practitioner
• Medicine
• Health
• Healthcare

Microsoft Word - Saberi_Roxana.doc

Source URL: www.harrywalker.com

• Evin Prison
• Medill School of Journalism
• Saberi
• Miss America
• NCAA Award of Valor
• Shirin Ebadi
• Roxana Saberi
• Iran
• Human rights in Iran

AdWords and Generalized On-line Matching Aranyak Mehta Amin Saberi Umesh Vazirani

Source URL: www.stanford.edu

• Mathematics
• Applied mathematics
• Computer science
• MAX-3SAT
• Complex analysis
• Pi
• Randomized algorithm

Supply Chain Network Competition in Price and Quality with Multiple Manufacturers and Freight Service Providers Anna Nagurney, Sara Saberi, and Shivani Shukla Department of Operations and Information Management Isenberg

Source URL: supernet.isenberg.umass.edu

• Supply chain management
• Consumer theory
• Management
• Anna Nagurney
• Year of birth missing
• Oligopoly
• Demand
• Quality assurance
• Monopoly
• Business
• Technology
• Economics