7 papers · ranked by Valyu relevance
Claudio Vestini, Idris Kempf
Constrained quadratic programs and Euclidean projections are ubiquitous in engineering, arising in machine learning, estimation, control, and signal processing. Dykstra's algorithm is an iterative scheme for computing the Euclidean projection of an initial point onto the intersection of convex sets by successively…
Jing Xie, Qi Duan
Biological pathway analysis often requires identifying interventions that block reachability to an undesirable state, such as a disease-associated module, toxic byproduct, or adverse phenotype, while preserving reachability among essential biological functions. Motivated by this setting, we study the Reachability…
Yael Kirkpatrick, Liam Roditty, Richard Qi, Virginia Vassilevska Williams
Computing the diameter of a graph is a problem of great interest both in general algorithms research and specifically within fine-grained complexity, where it is a cornerstone hard problem. Recent work has achieved a full conditional lower bound tradeoff curve for both directed and undirected graphs. However, the best…
Sebastian Forster, Yasamin Nazari, Rajath Rao K. N., Antonis Skarlatos
In this paper, we study the $(k,z)$-clustering and $k$-center problems on graphs, where $(k,z)$-clustering generalizes the $k$-median ($z=1$) and $k$-means ($z=2$) problems. We obtain the following main results. Our first contribution is the first deterministic algorithm for $k$-center on graphs that achieves a…
Z. K. Abdurahman Baizal, Soni Fajar Surya Gumilang, Rio Nurtantyana, Rahmat Hendrawan + 1 more
Technological developments in recent years led to the emergence of increasingly sophisticated recommender systems to support multi-day travel itineraries that fall under the Tourist Trip Design Problem (TTDP). Various problem analogies are widely used to solve TTDP, such as Traveling Salesman Problem (TSP), Vehicle…
Jingyang Zhao, Mingyu Xiao
The multi-vehicle dial-a-ride problem (mDaRP) is a fundamental vehicle routing problem with pickups and deliveries, widely applicable in ride-sharing, economics, and transportation. Given a set of n locations, h vehicles of identical capacity λ located at various depots, and m ride requests each defined by a source and…
Leonard Bohnenkämper, Luca Parmigiani, Cedric Chauve, Jens Stoye
Genomic rearrangements are major drivers of evolution and genetic disease. However, studying rearrangements requires segmenting the genomes of interest into conserved regions, called synteny blocks, that highlight structural differences between genomes. Synteny blocks are typically defined from annotated genes or…