# Search results

Advances in Water Resources > 2014 > 69 > Complete > 168-180

International Journal of Communication Systems > 33 > 8 > n/a - n/a

International Journal for Numerical Methods in Engineering > 121 > 2 > 187 - 200

Mathematical Methods in the Applied Sciences > 42 > 16 > 5595 - 5606

Russian Mathematics > 2019 > 63 > 5 > 57-62

*f*with Faber-Schauder coefficients |

*A*

_{n}(

*f*)| =

*O*(log

^{−1}

*n*) and divergent greedy algorithm.

Computational Optimization and Applications > 2019 > 74 > 2 > 517-545

Wireless Networks > 2019 > 25 > 8 > 4947-4962

Electronics and Communications in Japan > 102 > 6 > 3 - 11

Journal of the Operations Research Society of China > 2019 > 7 > 3 > 449-459

*f*and normalized non-negative monotone set function

*g*. We take advantage of the greedy technique and get a performance guarantee depending on the generalized curvature and inverse generalized curvature of

*f*, as well as the submodularity ratio of

*g*. Our results generalize...

Journal of Signal Processing Systems > 2019 > 91 > 10 > 1191-1204

Journal of Real-Time Image Processing > 2019 > 16 > 3 > 661-671

International Journal for Equity in Health > 2018 > 17 > 1 > 1-13

Wireless Personal Communications > 2019 > 104 > 3 > 1133-1148

GEM - International Journal on Geomathematics > 2018 > 9 > 2 > 167-198

Applied Network Science > 2018 > 3 > 1 > 1-14

Frontiers of Information Technology & Electronic Engineering > 2018 > 19 > 4 > 503-512

Computational and Applied Mathematics > 2018 > 37 > 5 > 5681-5701

Journal of Graph Theory > 88 > 3 > 449 - 481

*G*is a spanning subgraph with maximum degree two. The size of a 2‐matching

*U*is the number of edges in

*U*and this is at least $n-\kappa \left(U\right)$ where

*n*is the number of vertices of

*G*and κ denotes the number of components. In this article, we analyze the performance of a greedy algorithm 2greedy for finding a large 2‐matching on a random 3‐regular graph. We prove that with high probability,...

Acta Mathematica Hungarica > 2018 > 155 > 1 > 130-140

*n*-dimensional sphere and

*n*-dimensional Euclidean space to give short and transparent...