Results 31 to 40 of about 1,005,063 (328)

An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

, 2009
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang.
Aardal, Karen, Byrka, Jaroslaw
core   +2 more sources

Revision of Specification Automata under Quantitative Preferences [PDF]

, 2014
We study the problem of revising specifications with preferences for automata based control synthesis problems. In this class of revision problems, the user provides a numerical ranking of the desirability of the subgoals in their specifications.
Fainekos, Georgios, Kim, Kangjin
core   +1 more source

A 2.75-Approximation Algorithm for the Unconstrained Traveling Tournament Problem

, 2011
A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem.
C. Thielen, C. Thielen, D. Yamaguchi, G. Kendall, K. Easton, M. A. Trick, N. Fujiwara, R. Miyashiro, R. V. Rasmussen, Ryuhei Miyashiro, S. Imahori, S. Urrutia, S. Westphal, Shinji Imahori, Tomomi Matsui   +14 more
core   +1 more source

Rounding in ¿-approximation algorithms

2006 Symposium on Communications and Vehicular Technology, 2006
A common approach to deal with NP-hard problems is to deploy polynomial-time ϵ-approximation algorithms. These algorithms often resort to rounding and scaling to guarantee a solution that is within a factor (1 + isin) of the optimal solution. Usually, researchers either only round up or only down.
openaire   +4 more sources

Approximate Weak Greedy Algorithms [PDF]

Advances in Computational Mathematics, 2001
We present a generalization of V. Temlyakov's weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries.
Gribonval, Rémi, Nielsen, Morten
openaire   +3 more sources

Prolonged Corrected QT Interval as an Early Electrocardiographic Marker of Cyclophosphamide‐Induced Cardiotoxicity in Pediatric Hematology and Oncology Patients

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Background Cyclophosphamide (CY) is associated with potentially fatal cardiotoxicity, yet no electrocardiographic indices have been established for early detection of CY‐induced cardiomyopathy. This study aimed to determine whether corrected QT interval (QTc) prolongation can predict early onset of CY‐related cardiac dysfunction in pediatric ...
Junpei Kawamura, Kentaro Ueno, Takuro Nishikawa, Yoshihiro Takahashi, Koji Nakae, Yasuhiro Okamoto   +5 more
wiley   +1 more source

Radio Mean Labeling Algorithm, Its Complexity and Existence Results

Mathematics
Radio mean labeling of a connected graph G is an assignment of distinct positive integers to the vertices of G satisfying a mathematical constraint called radio mean condition. The maximum label assigned to any vertex of G is called the span of the radio
Meera Saraswathi, K. N. Meera, Yuqing Lin   +2 more
doaj   +1 more source

Predicting Chronicity in Children and Adolescents With Newly Diagnosed Immune Thrombocytopenia at the Timepoint of Diagnosis Using Machine Learning‐Based Approaches

Pediatric Blood &Cancer, EarlyView.
ABSTRACT Objectives To identify predictors of chronic ITP (cITP) and to develop a model based on several machine learning (ML) methods to estimate the individual risk of chronicity at the timepoint of diagnosis. Methods We analyzed a longitudinal cohort of 944 children enrolled in the Intercontinental Cooperative immune thrombocytopenia (ITP) Study ...
Severin Kasser, Alice Bizeul, Meera Chitlur, Hugo Donato, Jelena Roganovic, Julia E. Vogt, Thomas Kühne   +6 more
wiley   +1 more source

All-norm approximation algorithms [PDF]

Journal of Algorithms, 2002
Summary: A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different \(\ell_p\) norms. We address this problem by introducing the concept of an all-norm \(\rho\)-approximation algorithm, which supplies one ...
Azar, Yossi, Epstein, Leah, Richter, Yossi, Woeginger, Gerhard J.   +3 more
openaire   +5 more sources

Spatiotemporal and quantitative analyses of phosphoinositides – fluorescent probe—and mass spectrometry‐based approaches

FEBS Letters, EarlyView.
Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho, Shin Morioka, Junko Sasaki, Takehiko Sasaki   +3 more
wiley   +1 more source