This paper addresses a graph optimization problem, called the Witness Tr...
An edge-weighted, vertex-capacitated graph G is called stable if the val...
Many network design problems deal with the design of low-cost networks t...
The stable marriage problem with ties is a well-studied and interesting
...
Circuit-augmentation algorithms are a generalization of the Simplex meth...
Cooperative games are an important class of problems in game theory, whe...
The classical stable marriage problem asks for a matching between a set ...
An edge-weighted graph G=(V,E) is called stable if the value of a
maximu...