Zobrazeno 1 - 10
of 2 578
pro vyhledávání: '"Cheriyan, A."'
We present improved approximation algorithms for some problems in the related areas of Flexible Graph Connectivity and Capacitated Network Design. In the $(p,q)$-Flexible Graph Connectivity problem, denoted $(p,q)$-FGC, the input is a graph $G(V, E)$
Externí odkaz:
http://arxiv.org/abs/2411.18809
RAFGL2591 is a massive star-forming complex in the Cygnus-X region comprising of a cluster of embedded protostars and young stellar objects located at a distance of 3.33 kpc. We investigate low-frequency radio emission from the protostellar jet assoc
Externí odkaz:
http://arxiv.org/abs/2308.03329
Autor:
Savarimuthu, Bastin Tony Roy, Zareen, Zoofishan, Cheriyan, Jithin, Yasir, Muhammad, Galster, Matthias
Social inclusion is a fundamental feature of thriving societies. This paper first investigates barriers for social inclusion in online Software Engineering (SE) communities, by identifying a set of 11 attributes and organising them as a taxonomy. Sec
Externí odkaz:
http://arxiv.org/abs/2305.01273
Publikováno v:
Asian Journal of Medical Sciences, Vol 15, Iss 9, Pp 57-63 (2024)
Background: High prevalence of hypertension (HTN) is of major concern among the middle-aged population of Kerala. Understudied in the context of HTN is oxidative damage to DNA, which is caused by free radical assaults. The modern lifestyle associated
Externí odkaz:
https://doaj.org/article/ac5cec03985c4a8e881a13673666c1a1
We show that the Unconstrained Traveling Tournament Problem (UTTP) is APX-complete by presenting an L-reduction from a version of metric (1,2)-TSP to UTTP. Keywords: Traveling Tournament Problem, APX-complete, Approximation algorithms, Traveling Sale
Externí odkaz:
http://arxiv.org/abs/2212.09165
We present approximation algorithms for network design problems in some models related to the $(p,q)$-FGC model. Adjiashvili, Hommelsheim and M\"uhlenthaler introduced the model of Flexible Graph Connectivity that we denote by FGC. Boyd, Cheriyan, Ha
Externí odkaz:
http://arxiv.org/abs/2211.09747
Autor:
Thomas Cheriyan, Kevin Bai, Shreya Bayyapureddy, Anterpreet Dua, Paramvir Singh, Zhuo Sun, Chhaya Patel, Vikas Kumar
Publikováno v:
Saudi Journal of Anaesthesia, Vol 18, Iss 3, Pp 360-370 (2024)
Background: Randomized controlled trials (RCTs) investigating the efficacy of bispectral index (BIS) to reduce intra-operative awareness (IOA) have reported conflicting results. The purpose of this meta-analysis is to consolidate results from RCTs to
Externí odkaz:
https://doaj.org/article/8d19bac5c02e461ea9f68bf3eb6bd378
Publikováno v:
Biomedical Technology, Vol 6, Iss , Pp 61-74 (2024)
Nanotechnology has enormous promise for a wide range of applications in biology. Nanoparticles (NPs) have the benefit of improving bioactivity, decreasing toxicity, allowing for precision targeting, and modulating the release profile of encapsulated
Externí odkaz:
https://doaj.org/article/a8960b038cf540bba65008c0eec0c4dd
We address long-standing open questions raised by Williamson, Goemans, Vazirani and Mihail pertaining to the design of approximation algorithms for problems in network design via the primal-dual method (Combinatorica 15(3):435-454, 1995). Williamson
Externí odkaz:
http://arxiv.org/abs/2209.11209
The $k$-Steiner-2NCS problem is as follows: Given a constant $k$, and an undirected connected graph $G = (V,E)$, non-negative costs $c$ on $E$, and a partition $(T, V-T)$ of $V$ into a set of terminals, $T$, and a set of non-terminals (or, Steiner no
Externí odkaz:
http://arxiv.org/abs/2206.11807