Výsledky vyhľadávania - polynomial time \(\rho\)-approximation algorithm

APPROXIMATION ALGORITHMS FOR CLUSTERING TO MINIMIZE THE SUM OF DIAMETERS

Prispievatelia: Reidys, S

Zdroj: Conference: ALGORITHMIC THEORY, BERGEN (NO), 07/05/2000--07/07/2000; Other Information: PBD: 1 Feb 2000

Popis súboru: Medium: P; Size: 14 pages

Prístupová URL adresa: http://www.osti.gov/scitech/servlets/purl/763370

The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems

Autori: Demange, Marc Paschos, Vangelis Université Paris 1 a ďalší

Prispievatelia: Demange, Marc Paschos, Vangelis Université Paris 1 a ďalší

Zdroj: Computational Optimization and Applications. 7:307-324

Predmety: Convex programming, Combinatorial optimization, polynomial time approximation algorithm, 0211 other engineering and technologies, quadratic programming, 02 engineering and technology, Programming involving graphs or networks, Quadratic programming, independent set, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), NP-complete problem, vertex covering, quadratic programming as subproblem, polynomial time \(\rho\)-approximation algorithm, Abstract computational complexity for mathematical programming problems, Recherche opérationnelle

Popis súboru: application/xml

Prístupová URL adresa: https://basepub.dauphine.fr/handle/123456789/2774
https://rd.springer.com/article/10.1023/A%3A1008660812834
https://dblp.uni-trier.de/db/journals/coap/coap7.html#DemangeP97
https://link.springer.com/article/10.1023%2FA%3A1008660812834

Fixed-Parameter and Approximation Algorithms: A New Look

Autori: Chitnis, Rajesh Hajiaghayi, MohammadTaghi Kortsarz, Guy

Témy: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1308.3520

One Shot Inverse Scattering Revisited.

Autori: Griesmaier, Roland Hanke, Martin

Zdroj: SIAM Journal on Imaging Sciences; 2025, Vol. 18 Issue 2, p881-905, 25p

Regularization with Optimal Space-Time Priors.

Autori: Bubba, Tatiana A. Heikkilä, Tommi Labate, Demetrio a ďalší

Zdroj: SIAM Journal on Imaging Sciences; 2025, Vol. 18 Issue 3, p1563-1600, 38p

A Deterministic Reduction for the Gap Minimum Distance Problem.

Autori: Cheng, Qi Wan, Daqing

Zdroj: IEEE Transactions on Information Theory. Nov2012, Vol. 58 Issue 11, p6935-6941. 7p.

Predmety: *ALGORITHMS, *APPROXIMATION theory, *CRYPTOGRAPHY, NP-complete problems, POLYNOMIALS, CODING theory

Linesearch-Enhanced Forward-Backward Methods for Inexact Nonconvex Scenarios.

Autori: Bonettini, Silvia Franchini, Giorgia Pezzi, Danilo a ďalší

Zdroj: SIAM Journal on Imaging Sciences; 2025, Vol. 18 Issue 2, p1314-1343, 40p

Efficient Nonlocal Linear Image Denoising: Bilevel Optimization with Nonequispaced Fast Fourier Transform and Matrix–Free Preconditioning.

Autori: Miniguano–Trujillo, Andrés Pearson, John W. Goddard, Benjamin D.

Zdroj: SIAM Journal on Imaging Sciences; 2025, Vol. 18 Issue 3, p1857-1903, 47p

A Multi-start Algorithm with Iterated Decremental Local Search for Minimum Capacitated Dominating Set Problem in Large Graphs.

Autori: Hu, Shuli Zhou, Shuang Ling, Dian a ďalší

Zdroj: Memetic Computing; Sep2025, Vol. 17 Issue 3, p1-35, 35p

Characterizing the topographic index as a tool to represent spatial soil moisture: The effect of classification approach, digital elevation model type, and resolution.

Autori: Asfaw, Binyam Workeye Fuka, Daniel R. Collick, Amy S. a ďalší

Zdroj: Vadose Zone Journal; Jul2025, Vol. 24 Issue 4, p1-17, 17p

Predmety: SOIL moisture, DIGITAL elevation models, K-means clustering, CLASSIFICATION, TOPOGRAPHY, HYDROLOGIC models, SPATIAL variation

A Nonlinear Elasticity Model in Computer Vision.

Autori: Ball, John M. Horner, Christopher L.

Zdroj: SIAM Journal on Imaging Sciences; 2025, Vol. 18 Issue 4, p2458-2488, 31p

Moderately exponential time algorithms for the maximum induced matching problem.

Autori: Chang, Maw-Shang Chen, Li-Hsuan Hung, Ling-Ju

Zdroj: Optimization Letters; Jun2015, Vol. 9 Issue 5, p981-998, 18p

Fast Certifiable Algorithm for the Absolute Pose Estimation of a Camera.

Autori: Garcia-Salguero, Mercedes Dima, Elijs Mateus, André a ďalší

Zdroj: SIAM Journal on Imaging Sciences; 2024, Vol. 17 Issue 3, p1415-1432, 18p

The Split Gibbs Sampler Revisited: Improvements to Its Algorithmic Structure and Augmented Target Distribution.

Autori: Pereyra, Marcelo Vargas-Mieles, Luis A. Zygalakis, Konstantinos C.

Zdroj: SIAM Journal on Imaging Sciences; 2023, Vol. 16 Issue 4, p2040-2071, 32p

CORRELATION DECAY AND PARTITION FUNCTION ZEROS: ALGORITHMS AND PHASE TRANSITIONS.

Autori: JINGCHENG LIU SINCLAIR, ALISTAIR SRIVASTAVA, PIYUSH

Zdroj: SIAM Journal on Computing; 2025, Vol. 54 Issue 4, p200-252, 53p

Predmety: PARTITION functions, ISING model, APPROXIMATION algorithms, POTTS model, SPATIAL analysis (Statistics), PHASE transitions

Toward Improved Simulations of Disruptive Reservoirs in Global Hydrological Modeling.

Autori: Shrestha, P. K. Samaniego, L. Rakovec, O. a ďalší

Zdroj: Water Resources Research; Apr2024, Vol. 60 Issue 4, p1-38, 38p

Predmety: HYDROLOGIC models, STREAMFLOW, RANDOM forest algorithms, WATER management, WATER power, RESERVOIRS

PACKING AND COVERING A GIVEN DIRECTED GRAPH IN A DIRECTED GRAPH.

Autori: YUSTER, RAPHAEL

Zdroj: SIAM Journal on Discrete Mathematics; 2024, Vol. 38 Issue 1, p43-54, 12p

Predmety: DIRECTED graphs, POLYNOMIAL time algorithms

Geografický termín: THAILAND

CONSTANT-RATIO APPROXIMATION FOR ROBUST BIN PACKING WITH BUDGETED UNCERTAINTY.

Autori: BOUGERET, MARIN DÓSA, GYÖRGY GOLDBERG, NOAM a ďalší

Zdroj: SIAM Journal on Discrete Mathematics; 2022, Vol. 36 Issue 4, p2534-2552, 19p

Predmety: BIN packing problem, APPROXIMATION algorithms, ROBUST optimization

Submodular batch scheduling on parallel machines.

Autori: Sun, Tao Wang, Jun‐Qiang Fan, Guo‐Qiang a ďalší

Zdroj: Naval Research Logistics; Mar2025, Vol. 72 Issue 2, p242-259, 18p

Predmety: BATCH processing, SCHEDULING, GREEDY algorithms, NP-hard problems, PARALLEL computers, HEAT treatment

FROM GAP-EXPONENTIAL TIME HYPOTHESIS TO FIXED PARAMETER TRACTABLE INAPPROXIMABILITY: CLIQUE, DOMINATING SET, AND MORE.

Autori: CHALERMSOOK, PARINYA CYGAN, MAREK KORTSARZ, GUY a ďalší

Zdroj: SIAM Journal on Computing; 2020, Vol. 49 Issue 4, p772-810, 39p

Predmety: DOMINATING set, BIPARTITE graphs, APPROXIMATION algorithms, SUBGRAPHS, COMPUTABLE functions, ALGORITHMS, HYPOTHESIS