Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, July 21, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Masashi Kiyomi (National Institute of Informatics (NII)
We present two efficient algorithms for solving the electric power transaction problem. The electric power transaction problem appears when maximizing the social benefit on electric power transactions between some companies. The problem is a special case of the minimum cost flow problem; on a network with few vertices with degrees at least two, and many vertices with degrees one. Our first algorithm is based on the minimum cycle canceling algorithm and the second algorithm uses a linear time median finding algorithm. On a network having n vertices with k vertices of degrees more than one, the first algorithm finds an optimal solution in O(n log n k6 log(kC)) time, where C is the highest electric power price per unit that the companies may offer. The second algorithm takes O((n+k4)2kk!) time, which is linear in n. In practice, k is small and n is very large, hence these algorithms are efficient compared to the other network flow algorithms.
Automatic MiSe System Software Version 1.4803M | admin login