Category Archives: news

18 Sept 2013 @ 1:00 – 1:50 pm
Room: E575
Presenter: Ram Dahal

Abstract: We present a generalization of the classical vertex colouring problem, weighted colouring, that has applications in the management of wireless networks. We focus on the simplest network topology, the path graph. Time permitting, we conclude with several open problems.

Bio: Ram Dahal is a PhD candidate in Computer Science at The University of Lethbridge. He is a member of the Optimization Research Group since September 2012.

Thursday April 11, from 12:15-13:05
Room E-575
Speaker: Daya Gaur.
Abstract:
Given a fleet of vehicles and a set of customers, the objective in capaciated vehicle routing problems is to minimize the total distance traveled and serve the customers subject to vehicle capacity constraints. We will examine existing approximation algorithms for deterministic and stochastic versions of capaciated vehicle routing problems.
This talk is open to everyone. Graduate students are encouraged to attend. Light refreshments will be served.

Thursday Mar 21 from 12:15-13:05
Room E-575
Speaker: Ram Dahal
Ram will talk about the weighted colouring problem in a graph and its connection to routing and scheduling in wireless networks.
Everyone is welcome. All graduate students are encouraged to attend. Light refreshments will be served.

Saturday May 16 2013:
Ram Dahal presented a poster about his research at the Meeting of the Minds conference at the University of Lethbridge. The conference is organized by the graduate students’ association and is the main event where students showcase their work to the community, establish new contacts, exchange ideas, and have a good time.

Thursday Feb 28 from 12:15-13:05
Room E-575
Speaker: Ram Dahal
Ram will talk about a paper on joint routing and scheduling in wireless networks by Mahmoud and Elmallah, “An algorithm for incremental joint routing and scheduling in wireless mesh networks”, WCNC 2010.
Everyone is welcome. All graduate students are encouraged to attend. Light refreshments will be served.

Thursday Feb 14 from 12:15-13:05
Room E-575
Speaker: Mark Thom
Mark will talk about another dynamic programming algorithm used to solve several facility location problems on the real line. The results appear in a 1996 paper of Tamir and Megiddo.
Everyone is welcome. All graduate students are encouraged to attend. Light refreshments will be served.

DATE CHANGE: Thursday Feb 7 from 12:15-13:05
Speaker: Mark Thom
Theme: Mark will talk about covering facility location problems on the real line. He will talk about his result on the customer constrained maximum covering, then about a paper by Tamir & Megiddo on facility constrained covering on the real line.

Room: E575
Thursdays, 12:15 – 13:05
Everyone is welcome. Graduate students are encouraged to participate. Light refreshments will be served.

ROOM CHANGE: E575
Title: “Algorithmic aspects of capacity in wireless networks”, Kumar et.al.
Speaker: Ram Dahal
Theme: we continue the topic of routing and interference as generalizations of max flow problems begun last week. The paper precedes Alicherry et.al. presented last week and the paper is simpler as channel assignment is not considered.

Room: E575
12:15 – 13:05
(everyone is welcome – grad students are encouraged to participate)

Our Optimization Research Group Seminar starts this semester on Tuesday Jan 23 at noon with Ram Dahal’s presentation of Alicherry et al. “Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks”. The theme of the paper is a generalization of the Maximum Flow Problem to account for interference and channel assignment in wireless networks. Everyone is welcome. Graduate students are encouraged to attend.

Location: Optimization Lab, C553
Time: 12:10 – 13:00

I am pleased to announce that our Optimization Research Group Seminar has just received funding from PIMS. This will allow us to bring distinguished external speakers, as soon as the summer of 2013.