Results 71 to 80 of about 255,219 (274)
A study on exponential-size neighborhoods for the bin packing problem with conflicts
, 2017 We propose an iterated local search based on several classes of local and large neighborhoods for the bin packing problem with conflicts. This problem, which combines the characteristics of both bin packing and vertex coloring, arises in various ...
Capua, Renatha +3 more
core +1 more source
Approximability of the Multiple Stack TSP [PDF]
, 2009 STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability.
Toulouse, Sophie
core +4 more sources
Molecular Oncology, EarlyView.A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
Every subcubic graph is packing (1,1,2,2,3)-colorable
Discrete Mathematics9 pages, 2 ...
Xujun Liu, Xin Zhang, Yanting Zhang
openaire +2 more sources
Bin Packing with Multiple Colors
, 2015 In the Colored Bin Packing problem a set of items with varying weights and colors must be packed into bins of uniform weight limit such that no two items of the same color may be packed adjacently within a bin. We solve this problem for the case where there are two or more colors when the items have zero weight and when the items have unit weight.
Alsarhan, Hamza +4 more
openaire +2 more sources
Molecular Oncology, EarlyView.In this exploratory study, we investigated the relationship between the gut microbiota and outcome in patients with metastatic hormone receptor‐positive breast cancer, treated in a randomized clinical trial with chemotherapy alone or chemotherapy in combination with immune checkpoint blockade.
Andreas Ullern +7 more
wiley +1 more source
On the Complexity of Local Distributed Graph Problems
, 2017 This paper is centered on the complexity of graph problems in the well-studied LOCAL model of distributed computing, introduced by Linial [FOCS '87].
Alon N. +5 more
core +1 more source
Complexity of the packing coloring problem for trees
Discrete Applied Mathematics, 2008 A packing \(k\)-colouring of a graph \(G=(V,E)\) is a list \((X_1, X_2, \dots, X_k)\) of sets with \(\bigcup_{i=1}^k X_i = V\), such that for every index \(i\) with \(1 \leq i \leq k\), every pair of different vertices \(u,v \in X_i\) has distance at least \(i\) in \(G\) [see \textit{B. Brešar}, \textit{S. Klavžar}, and \textit{D.F.
Fiala, Jiří, Golovach, Petr A.
openaire +2 more sources
A synthetic benzoxazine dimer derivative targets c‐Myc to inhibit colorectal cancer progression
Molecular Oncology, EarlyView.Benzoxazine dimer derivatives bind to the bHLH‐LZ region of c‐Myc, disrupting c‐Myc/MAX complexes, which are evaluated from SAR analysis. This increases ubiquitination and reduces cellular c‐Myc. Impairing DNA repair mechanisms is shown through proteomic analysis.
Nicharat Sriratanasak +8 more
wiley +1 more source
Molecular Oncology, EarlyView.This study integrates transcriptomic profiling of matched tumor and healthy tissues from 32 colorectal cancer patients with functional validation in patient‐derived organoids, revealing dysregulated metabolic programs driven by overexpressed xCT (SLC7A11) and SLC3A2, identifying an oncogenic cystine/glutamate transporter signature linked to ...
Marco Strecker +16 more
wiley +1 more source