Item

Graphs inducing totally balanced and submodular Chinese postman games

Josune Albizuri,M.
; 
Hamers,H.J.M.
Abstract
A Chinese postman (CP) game is induced by a weighted undirected, connected graph in which the edges are identified as players and a vertex is chosen as post-office location. Granot and Granot (2012) characterized graphs that give rise to CP games that are balanced. This note completes this line of research by characterizing graphs that give rise to CP games that are submodular (totally balanced, respectively).
Description
Date
2014-07-31
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Research Projects
Organizational Units
Journal Issue
Keywords
Chinese Postman games, submodularity, totally balancedness
Citation
Josune Albizuri, M & Hamers, H J M 2014, 'Graphs inducing totally balanced and submodular Chinese postman games', Discrete Applied Mathematics, vol. 172, pp. 98-103. https://doi.org/10.1016/j.dam.2014.03.002
URI
https://hdl.handle.net/20.500.14602/61305
Embedded videos