Approximation algorithms for finding a maximum-weight spanning connected subgraph with given vertex degrees
Year of publication: |
2005
|
---|---|
Authors: | Baburin, Alexey E. ; Gimadi, Edward Kh. |
Published in: |
Operations research proceedings 2004 : selected papers of the annual international conference of the German Operations Research Society (GOR) ; Tilburg, September 1 - 3, 2004. - Berlin : Springer, ISBN 3-540-24274-0. - 2005, p. 343-351
|
Subject: | Algorithmus | Algorithm | Theorie | Theory | Operations Research | Operations research |
-
Scheduling flow shops with blocking using a discrete self-organising migrating algorithm
Davendra, Donald, (2013)
-
Baker, Tim, (2012)
-
Online algorithms for scheduling two parallel machines with a single server
Jiang, Yiwei, (2015)
- More ...
-
Baburin, Alexey E., (2004)
-
On some probability inequalities for some discrete optimization peoblems
Gimadi, Edward Kh., (2006)
- More ...