Výsledky vyhledávání - analysis of algorithms and (problem OR problemy) complexity

Stable Approximation Algorithms for Dominating Set and Independent Set: Stable approximation algorithms for dominating set and independent set

Autoři: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Přispěvatelé: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Zdroj: SIAM Journal on Discrete Mathematics. 39:921-945

Témata: FOS: Computer and information sciences, dynamic algorithms, Discrete Mathematics (cs.DM), Analysis of algorithms and problem complexity, General topics of discrete mathematics in relation to computer science, dominating set, stability, Approximation algorithms, bounded recourse, independent set, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, approximation algorithms, Dynamic algorithms, Computer Science - Discrete Mathematics

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2412.13358
https://zbmath.org/8037180
https://doi.org/10.1137/24m1644079
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.27

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem: Stable approximation algorithms for the dynamic broadcast range-assignment problem

Autoři: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Přispěvatelé: Mark de Berg Arpan Sadhukhan Frits Spieksma a další

Zdroj: SIAM Journal on Discrete Mathematics. 38:790-827

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, broadcast range assignment, online algorithms, stable approximation schemes, Analysis of algorithms and problem complexity, Discrete geometry, General topics of discrete mathematics in relation to computer science, 0102 computer and information sciences, 68W27, 68Q25, 01 natural sciences, Computational geometry, bounded recourse, F.2.2, F.2.3, Computer graphics, computational geometry (digital and algorithmic aspects), Computer Science - Data Structures and Algorithms, computational geometry, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, broadcast range assignement

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2112.05426
https://research.tue.nl/en/publications/e5bf163d-884a-4515-8198-681071448b9c
https://doi.org/10.4230/LIPIcs.SWAT.2022.15
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.15

Symmetries in constraint satisfaction: Weisfeiler-Leman invariance and promise problems

Autoři: Butti, Silvia

Přispěvatelé: University/Department: Universitat Pompeu Fabra. Departament de Tecnologies de la Informació i les Comunicacions

Thesis Advisors: Dalmau, Víctor

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Constraint satisfaction problems, Linear programming, Weisfeiler-Leman algorithm, Sherali-Adams hierarchy, Distributed algorithms, Model checking, Problema de satisfacción de restricciones, Programación lineal, Algoritmo de Weisfeiler-Leman, Jerarquía de Sherali-Adams, Algoritmos distribuidos, Verificación de modelos, Problema de satisfacció de restriccions, Programació lineal, Algoritme de Weisfeiler-Leman, Jerarquia de Sherali-Adams, Algorismes distribuïts, Verificació de models

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/675788

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints

Autoři: Kameng Nip Zhenbo Wang

Zdroj: Journal of Scheduling. 26:543-558

Témata: 8. Economic growth, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/article/10.1007/s10951-021-00677-8

Enumerating Minimal Connected Dominating Sets: Enumerating minimal connected dominating sets

Autoři: Faisal Abu-Khzam Henning Fernau Benjamin Gras a další

Přispěvatelé: Faisal Abu-Khzam Henning Fernau Benjamin Gras a další

Zdroj: SIAM Journal on Discrete Mathematics. 39:946-972

Témata: connected domination, Connectivity, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), enumeration problems, degenerate graphs, Graph algorithms (graph-theoretic aspects), Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Analysis of algorithms, ddc:004, Enumeration in graph theory, Nonnumerical algorithms

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.1

On a Class of Interdiction Problems with Partition Matroids: Complexity and Polynomial-Time Algorithms

Autoři: Sergey S. Ketkov Oleg A. Prokopyev

Zdroj: INFORMS Journal on Computing.

Témata: FOS: Computer and information sciences, Computational Complexity, Optimization and Control (math.OC), Optimization and Control, 0211 other engineering and technologies, FOS: Mathematics, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2401.12010

Unary NP-hardness of transportation and batching scheduling to minimize the total weighted completion time

Autoři: Wei, Hongjun Gao, Yuan Yuan, Jinjiang

Zdroj: Discrete Applied Mathematics. 369:45-52

Témata: transportation, Transportation, logistics and supply chain management, total weighted completion time, Deterministic scheduling theory in operations research, Analysis of algorithms and problem complexity, batching scheduling, unary NP-hard

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8028611
https://doi.org/10.1016/j.dam.2025.02.023

The algorithm and complexity of co-secure domination in geometric intersection graphs

Autoři: Wang, Cai-Xia Yang, Yu Xu, Shou-Jun

Zdroj: Computational and Applied Mathematics. 44

Témata: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), co-secure domination, Analysis of algorithms and problem complexity, geometric intersection graphs, APX-hard, approximation algorithm, NP-complete

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7959238
https://doi.org/10.1007/s40314-024-02982-2

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems: Interpolation conditions for linear operators and applications to performance estimation problems

Autoři: Nizar Bousselmi Julien M. Hendrickx François Glineur a další

Přispěvatelé: Nizar Bousselmi Julien M. Hendrickx François Glineur a další

Zdroj: SIAM Journal on Optimization, Vol. 34, no.3, p. 3033-3063 (2024)

Témata: Convex programming, Analysis of algorithms and problem complexity, exact convergence rates, interpolation conditions, 0211 other engineering and technologies, 02 engineering and technology, Quadratic programming, performance estimation, Numerical methods involving duality, primal-dual algorithms, first-order algorithms, linear operators, Optimization and Control (math.OC), FOS: Mathematics, Semidefinite programming, 90C25, 90C20, 68Q25, 90C22, 49M29, quadratic functions, Mathematics - Optimization and Control

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2302.08781
https://zbmath.org/7909893
https://doi.org/10.1137/23m1575391
https://hdl.handle.net/2078.1/293045

Deep Multimodal Learning for Egocentric Storytelling and Food Analysis

Autoři: Bolaños Solà, Marc

Přispěvatelé: University/Department: Universitat de Barcelona. Departament de Matemàtiques i Informàtica

Thesis Advisors: Radeva, Petia

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Aprenentatge automàtic, Aprendizaje automático, Machine learning, Algorismes, Algoritmos, Algorithms, Adquisició del coneixement (Sistemes experts), Adquisición de conocimientos (Sistemas expertos), Knowledge acquisition (Expert systems), Percepció de les formes, Percepción de formas, Form perception, Xarxes neuronals convolucionals, Redes neuronales convolucionales, Convolutional neural networks, Ciències Experimentals i Matemàtiques

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/671672

Combinatorial and Machine Learning Techniques for Complex Thin Film Photovoltaics: Accelerated Research and Process Monitoring Methodologies

Autoři: Grau Luque, Enric Tomás

Přispěvatelé: University/Department: Universitat de Barcelona. Facultat de Física

Thesis Advisors: Izquierdo Roca, Victor, Guc, Maxim, Pérez Rodríguez, Alejandro

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Anàlisi combinatòria, Análisis combinatorio, Combinatorial analysis, Intel·ligència artificial, Inteligencia artificial, Artificial intelligence, Espectroscòpia d'electrons, Espectroscopía electrónica, Electron spectroscopy, Aprenentatge automàtic, Aprendizaje automático, Machine learning, Ciències Experimentals i Matemàtiques

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/691171

Mixed Precision HODLR Matrices: Mixed precision HODLR matrices

Autoři: Erin Carson Xinye Chen Xiaobo Liu a další

Přispěvatelé: Erin Carson Xinye Chen Xiaobo Liu a další

Zdroj: SIAM Journal on Scientific Computing. 47:A1408-A1435

Témata: hierarchical matrices, Hierarchical matrices, 65D18, Roundoff error, mixed precision computing, Analysis of algorithms and problem complexity, 65G50, 65F55, 68Q25, 65D18, 68Q25, Numerical methods for low-rank matrix approximation, matrix compression, matrix computations AMS subject classifications. 65G50, Numerical Analysis (math.NA), [INFO] Computer Science [cs], Hierarchical matrices mixed precision computing matrix computations AMS subject classifications. 65G50 65F55 68Q25 65D18, Numerical aspects of computer graphics, image analysis, and computational geometry, FOS: Mathematics, Mathematics - Numerical Analysis, matrix computations, 65F55

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.21637
https://hal.science/hal-05066310v1
https://doi.org/10.1137/24m1683925
https://hal.science/hal-05066310v1/document

Beyond Complexity: An Experimental Study of Maximum Flow Algorithms

Autoři: Borralho, Rafael Tavares Mamede, Margarida RUN

Přispěvatelé: Borralho, Rafael Tavares Mamede, Margarida RUN

Témata: Maximum flow, Algorithms, Time complexity, Experimental analysis, Comparative analysis, Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Popis souboru: application/pdf

Dostupnost: http://hdl.handle.net/10362/178443

Distributed consensus algorithms for wireless sensor networks: convergence analysis and optimization

Autoři: Silva Pereira, Silvana

Přispěvatelé: University/Department: Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions

Thesis Advisors: Pagès Zamora, Alba Maria

Zdroj: TDX (Tesis Doctorals en Xarxa)

Time: 621.3

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/131997
https://dx.doi.org/10.5821/dissertation-2117-95184

Decomposition of the option pricing formula for infinite activity jump-diffusion stochastic volatility models

Autoři: Youssef El-Khatib Zororo S. Makumbe Josep Vives

Zdroj: Mathematics and Computers in Simulation. 231:276-293

Témata: option price decomposition, Lévy processes, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, variance gamma, Computer graphics, computational geometry (digital and algorithmic aspects), tempered stable, stochastic volatility

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8031680
https://doi.org/10.1016/j.matcom.2024.12.010

Matchings, Relaxed Popularity, and Optimality: Matchings, relaxed popularity, and optimality

Autoři: Kavitha, Telikepalli

Zdroj: SIAM Journal on Discrete Mathematics. 39:881-911

Témata: Combinatorial optimization, Matching models, stable matchings, bipartite graphs, mixed matchings, Analysis of algorithms and problem complexity, dual certificates

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/8037178
https://doi.org/10.1137/24m163596x

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG

Autoři: Cáceres, Manuel Mumey, Brendan Husić, Edin a další

Zdroj: IEEE/ACM Transactions on Computational Biology & Bioinformatics. 19(6):3673-3684

Témata: Graph algorithms, Network problems, Analysis of Algorithms and Problem Complexity, Biology and genetics, datalogi, Computer Science

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-199751
https://doi.org/10.1109/tcbb.2021.3131203

HODLR3D: hierarchical matrices for N-body problems in three dimensions: HODLR3D: hierarchical matrices for \(N\)-body problems in three dimensions

Autoři: Kandappan, V. A. Gujjula, Vaishnavi Ambikasaran, Sivaram

Zdroj: Numerical Algorithms. 97:1635-1672

Témata: hierarchical matrices, 68Q25, 68R10, 68U05, 45B05, 68U20, \(N\)-body problems, HODLR, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, Computer graphics, computational geometry (digital and algorithmic aspects), FOS: Mathematics, Fredholm integral equations, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Simulation

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2307.16303
https://zbmath.org/7958575
https://doi.org/10.1007/s11075-024-01765-4

A study on structure recovery and the broadcasting problem

Autoři: Velona, Vasiliki

Přispěvatelé: University/Department: Universitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística

Thesis Advisors: Lugosi, Gábor, Rué Perna, Juan José

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Àrees temàtiques de la UPC::Matemàtiques i estadística

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/672697
https://dx.doi.org/10.5821/dissertation-2117-355670

Advanced computational tools for EELS data reduction and clustering, quantitative analysis and 3D reconstructions

Autoři: Blanco Portals, Javier

Přispěvatelé: University/Department: Universitat de Barcelona. Facultat de Física

Thesis Advisors: Peiró Martínez, Francisca, Estradé Albiol, Sònia

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Nanociència, Nanociencia, Nanoscience, Tomografia, Tomografía, Tomography, Espectroscòpia de pèrdua d'energia d'electrons, Espectroscopía por pérdidas de energía de electrones, Electron energy loss spectroscopy, Ciències Experimentals i Matemàtiques

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/674279