Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 853 matches
- 2024
- Yingying Guo, Qiaoliang Li:
Approximation algorithms for the fault-tolerant facility location problem with submodular penalties. J. Comb. Optim. 47(2): 14 (2024) - Zuqiang Long, Zelong Luo, Yunmeng Wang:
Structure analysis and universal approximation of IT2 TS FLC using NT algorithm. J. Intell. Fuzzy Syst. 46(2): 4859-4867 (2024) - Amir Abboud, Greg Bodwin:
Reachability Preservers: New Extremal Bounds and Approximation Algorithms. SIAM J. Comput. 53(2): 221-246 (2024) - Christoph Buchheim, Alexandra Grütering, Christian Meyer:
Parabolic Optimal Control Problems with Combinatorial Switching Constraints, Part II: Outer Approximation Algorithm. SIAM J. Optim. 34(2): 1295-1315 (2024) - Tianshi Xu, Anthony Austin, Vasileios Kalantzis, Yousef Saad:
A Parallel Algorithm for Computing Partial Spectral Factorizations of Matrix Pencils via Chebyshev Approximation. SIAM J. Sci. Comput. 46(2): S324-S351 (2024) - Mariusz Ciesielski:
Numerical Algorithms for Approximation of Fractional Integrals and Derivatives Based on Quintic Spline Interpolation. Symmetry 16(2): 252 (2024) - Diego F. G. Coelho, Renato J. Cintra:
Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm. CoRR abs/2402.16225 (2024) - Junyoung Kim, Kyungsik Lee:
Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem. CoRR abs/2403.06686 (2024) - Md. Musfiqur Rahman Sanim, Safrunnesa Saira, Fatin Faiaz Ahsan, Rajon Bardhan, S. M. Ferdous:
A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem. CoRR abs/2403.11811 (2024) - 2023
- Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau:
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85(10): 3088-3109 (2023) - David Fischer, Péter Györgyi:
Approximation algorithms for coupled task scheduling minimizing the sum of completion times. Ann. Oper. Res. 328(2): 1387-1408 (2023) - Ciwen Chen, Guyan Ni, Bo Yang:
Partially symmetric tensor structure preserving rank-R approximation via BFGS algorithm. Comput. Optim. Appl. 85(2): 621-652 (2023) - Hirotaka Ono, Hisato Yamanaka:
An 8-approximation algorithm for L(2,1)-labeling of unit disk graphs. Discret. Appl. Math. 341: 93-101 (2023) - Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo:
Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time. Eur. J. Oper. Res. 305(2): 594-607 (2023) - Fangfang Wu, Xiandong Zhang, Bo Chen:
An improved approximation algorithm for scheduling monotonic moldable tasks. Eur. J. Oper. Res. 306(2): 567-578 (2023) - Soumaya Ferhat Taleb, Nour El-Houda Benalia, Rabah Sadoun:
Fitness approximation with RF algorithm dedicated to WSN node deployment for a soil monitoring application. Int. J. Ad Hoc Ubiquitous Comput. 43(2): 72-86 (2023) - Tianning Dong, Peiyi Zhang, Faming Liang:
A Stochastic Approximation-Langevinized Ensemble Kalman Filter Algorithm for State Space Models with Unknown Parameters. J. Comput. Graph. Stat. 32(2): 448-469 (2023) - Maolin Che, Yiming Wei, Yanwei Xu:
Randomized algorithms for the computation of multilinear rank-(μ 1,μ 2,μ 3) approximations. J. Glob. Optim. 87(2): 373-403 (2023) - Lu Han, Dachuan Xu, Yicheng Xu, Ping Yang:
Approximation algorithms for the individually fair k-center with outliers. J. Glob. Optim. 87(2): 603-618 (2023) - Qian Li, Wei Zhang, Yanqin Bai, Guoqiang Wang:
A non-convex piecewise quadratic approximation of ℓ 0 regularization: theory and accelerated algorithm. J. Glob. Optim. 86(2): 323-353 (2023) - Gehui Xu, Guanpu Chen, Hongsheng Qi:
Algorithm Design and Approximation Analysis on Distributed Robust Game. J. Syst. Sci. Complex. 36(2): 480-499 (2023) - Andreas Bärmann, Robert Burlacu, Lukas Hager, Katja Kutzer:
An Approximation Algorithm for Optimal Piecewise Linear Interpolations of Bounded Variable Products. J. Optim. Theory Appl. 199(2): 569-599 (2023) - Wandi Dong, Gaohang Yu, Liqun Qi, Xiaohao Cai:
Practical Sketching Algorithms for Low-Rank Tucker Approximation of Large Tensors. J. Sci. Comput. 95(2): 52 (2023) - Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A tight approximation algorithm for the cluster vertex deletion problem. Math. Program. 197(2): 1069-1091 (2023) - Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
A duality based 2-approximation algorithm for maximum agreement forest. Math. Program. 198(1): 811-853 (2023) - Zhisong Hou, Sanyang Liu:
Global algorithm for a class of multiplicative programs using piecewise linear approximation technique. Numer. Algorithms 92(2): 1063-1082 (2023) - David T. Mildebrath:
A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation. Optim. Lett. 17(2): 265-282 (2023) - Joel Antonio Trejo-Sánchez, Francisco Alejandro Madera-Ramírez, José Alberto Fernández-Zepeda, José Luis López-Martínez, Alejandro Flores-Lamas:
A fast approximation algorithm for the maximum 2-packing set problem on planar graphs. Optim. Lett. 17(6): 1435-1454 (2023) - Jun Wu, Yongxi Cheng, Zhen Yang, Feng Chu:
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints. Oper. Res. Lett. 51(5): 473-476 (2023) - João Victor B. de Freitas, Caio L. N. Azevedo, Juvêncio S. Nobre:
A stochastic approximation ECME algorithm to semi-parametric scale mixtures of centred skew normal regression models. Stat. Comput. 33(2): 51 (2023)
skipping 823 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-11 05:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint