Results 61 to 70 of about 6,450,253 (299)
Efficient Approximation for Restricted Biclique Cover Problems
Algorithms, 2018 Covering the edges of a bipartite graph by a minimum set of bipartite complete graphs (bicliques) is a basic graph theoretic problem, with numerous applications. In particular, it is used to characterize parsimonious models of a set of observations (each
Alessandro Epasto, Eli Upfal
doaj +1 more source
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
ACM-SIAM Symposium on Discrete Algorithms, 2016 The radius and diameter are fundamental graph parameters, with several natural definitions for directed graphs. Each definition is well-motivated in a variety of applications.
Amir Abboud +2 more
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT As part of the European Cooperative Study Group for Paediatric Rare Tumours initiative, we developed standard clinical practice guidelines for ovarian sex cord stromal tumors, based on comprehensive national and international cohort analyses, literature review, and a final expert consensus conference.
Dominik T. Schneider +15 more
wiley +1 more source
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems
Algorithms, 2022 Motivated by applications in ride-sharing and truck-delivery, we study the problem of matching a number of requests and assigning them to cars. A number of cars are given, each of which consists of a location and a speed, and a number of requests are ...
Kelin Luo, Frits C. R. Spieksma
doaj +1 more source
Algorithms for Verifying Deep Neural Networks [PDF]
Found. Trends Optim., 2019 Deep neural networks are widely used for nonlinear function approximation with applications ranging from computer vision to control. Although these networks involve the composition of simple arithmetic operations, it can be very challenging to verify ...
Changliu Liu +4 more
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric supportive care clinical trials often involve multiple clinically important outcomes, complicating trial interpretation. Hierarchical composite endpoints (HCEs) provide a framework to integrate key outcomes according to clinical importance.
Willem H. Collier +11 more
wiley +1 more source
Primal and dual approximation algorithms for convex vector optimization problems [PDF]
Journal of Global Optimization, 2013 Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson’s outer approximation algorithm,
Andreas Löhne +2 more
semanticscholar +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
Playing Games with Approximation Algorithms
SIAM Journal on Computing, 2007 In an online linear optimization problem, on each period $t$, an online algorithm chooses $s_t\in\mathcal{S}$ from a fixed (possibly infinite) set $\mathcal{S}$ of feasible decisions. Nature (who may be adversarial) chooses a weight vector $w_t\in\mathbb{R}^n$, and the algorithm incurs cost $c(s_t,w_t)$, where $c$ is a fixed cost function that is ...
Sham M. Kakade +2 more
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Timely cancer diagnosis in children and adolescents is important to improving outcomes. We aimed to quantify time to diagnosis and assess variations by patient, demographic and system‐level factors. Procedure We conducted a population‐based study of individuals aged 0–19 years diagnosed with one of 12 cancers from 2010 to 2022 in ...
Callum Mullen +5 more
wiley +1 more source