Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...