The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
Harold N. Gabow, Michel X. Goemans, David P. Willi...
This paper considers a wireless relay network with one source, one relay, and one destination. We propose a low-complexity quantize-and-forward (QF) scheme in which the relay calc...
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper...
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of ...
An efficient algorithm is given for the resolution of relative Thue equations. The essential improvement is the application of an appropriate version of Wildanger's enumeratio...