Polynomial-time approximation algorithms for the coloring problem in some cases
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0008-x
Abstract: We consider the coloring problem for hereditary graph classes, i.e. classes of simple unlabeled graphs closed under deletion of vertices. For the family of the hereditary classes of graphs defined by forbidden induced subgraphs with… read more here.
Keywords: coloring problem; time approximation; polynomial time; problem ... See more keywords
SAW-Less Direct RF Transmitter With Multimode Noise Shaping and Tri-Level Time-Approximation Filter
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Journal of Solid-State Circuits"
DOI: 10.1109/jssc.2021.3116933
Abstract: This article presents a multimode direct radio frequency (RF) transmitter capable of a high in-band dynamic range and a low out-of-band (OOB) noise floor. It features a hybrid digital-to-analog converter (DAC) with a reconfigurable dual-band… read more here.
Keywords: tri level; noise; transmitter; approximation filter ... See more keywords