Výsledky vyhledávání - "Dual approximation algorithm"
-
1
Jamming-Based Covert Communication for Rate-Splitting Multiple Access
ISSN: 0018-9545, 1939-9359Vydáno: New York IEEE 01.08.2023Vydáno v IEEE transactions on vehicular technology (01.08.2023)“… As the jamming signals also degrades the data rate of the users, we formulate an optimization problem that maximizes the minimum data rate over all the users subject to the constraints…”
Získat plný text
Journal Article -
2
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation
ISSN: 0025-5610, 1436-4646Vydáno: Berlin/Heidelberg Springer-Verlag 01.07.2010Vydáno v Mathematical programming (01.07.2010)“…We consider the “flow on paths” versions of Max Flow and Min Cut when we restrict to paths having at most B arcs, and for versions where we allow fractional…”
Získat plný text
Journal Article Konferenční příspěvek