×

zbMATH — the first resource for mathematics

Found 694 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Khandeev, Vladimir; Panasenko, Anna
Exact algorithm for the one-dimensional quadratic Euclidean cardinality-weighted 2-clustering with given center problem. (English) Zbl 07315669
Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-58656-0/pbk; 978-3-030-58657-7/ebook). Communications in Computer and Information Science 1275, 30-35 (2020).
MSC:  90C 68 91
PDF BibTeX XML Cite
\textit{V. Khandeev} and \textit{A. Panasenko}, Commun. Comput. Inf. Sci. 1275, 30--35 (2020; Zbl 07315669)
Full Text: DOI
Khandeev, Vladimir
Polynomial-time approximation scheme for a problem of searching for the largest subset with the constraint on quadratic variation. (English) Zbl 07250774
Sergeyev, Yaroslav D. (ed.) et al., Numerical computations: theory and algorithms. Third international conference, NUMTA 2019, Crotone, Italy, June 15–21, 2019. Revised selected papers. Part II. Cham: Springer (ISBN 978-3-030-40615-8/pbk; 978-3-030-40616-5/ebook). Lecture Notes in Computer Science 11974, 400-405 (2020).
MSC:  65
PDF BibTeX XML Cite
\textit{V. Khandeev}, Lect. Notes Comput. Sci. 11974, 400--405 (2020; Zbl 07250774)
Full Text: DOI
Kel’manov, Alexander; Khamidullin, Sergey; Panasenko, Anna
2-approximation polynomial-time algorithm for a cardinality-weighted 2-partitioning problem of a sequence. (English) Zbl 07250772
Sergeyev, Yaroslav D. (ed.) et al., Numerical computations: theory and algorithms. Third international conference, NUMTA 2019, Crotone, Italy, June 15–21, 2019. Revised selected papers. Part II. Cham: Springer (ISBN 978-3-030-40615-8/pbk; 978-3-030-40616-5/ebook). Lecture Notes in Computer Science 11974, 386-393 (2020).
MSC:  65
PDF BibTeX XML Cite
\textit{A. Kel'manov} et al., Lect. Notes Comput. Sci. 11974, 386--393 (2020; Zbl 07250772)
Full Text: DOI
Iwamoto, Chuzo; Ibusuki, Tatsuaki
Computational complexity of the chromatic art gallery problem for orthogonal polygons. (English) Zbl 07224280
Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39880-4/pbk; 978-3-030-39881-1/ebook). Lecture Notes in Computer Science 12049, 146-157 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
\textit{C. Iwamoto} and \textit{T. Ibusuki}, Lect. Notes Comput. Sci. 12049, 146--157 (2020; Zbl 07224280)
Full Text: DOI
Kel’manov, Alexander; Khandeev, Vladimir
The problem \(K\)-means and given \(J\)-centers: polynomial solvability in one dimension. (English) Zbl 1429.90096
Bykadorov, Igor (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1090, 207-216 (2019).
MSC:  90C47 90C39
PDF BibTeX XML Cite
\textit{A. Kel'manov} and \textit{V. Khandeev}, Commun. Comput. Inf. Sci. 1090, 207--216 (2019; Zbl 1429.90096)
Full Text: DOI
Kel’manov, A. V.; Khandeev, V. I.
Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem. (English. Russian original) Zbl 07150939
Comput. Math. Math. Phys. 59, No. 9, 1553-1561 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1617-1625 (2019).
MSC:  68Q25 90C20
PDF BibTeX XML Cite
\textit{A. V. Kel'manov} and \textit{V. I. Khandeev}, Comput. Math. Math. Phys. 59, No. 9, 1553--1561 (2019; Zbl 07150939); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1617--1625 (2019)
Full Text: DOI
Gordeev, E. N.; Leont’ev, V. K.
On combinatorial properties of the knapsack problem. (English. Russian original) Zbl 1425.90093
Comput. Math. Math. Phys. 59, No. 8, 1380-1388 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 8, 1439-1447 (2019).
MSC:  90C27
PDF BibTeX XML Cite
\textit{E. N. Gordeev} and \textit{V. K. Leont'ev}, Comput. Math. Math. Phys. 59, No. 8, 1380--1388 (2019; Zbl 1425.90093); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 8, 1439--1447 (2019)
Full Text: DOI
Madireddy, Raghunath Reddy; Mudgal, Apurva; Pandit, Supantha
Hardness results and approximation schemes for discrete packing and domination problems. (English) Zbl 07116396
Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer (ISBN 978-3-030-04650-7/pbk; 978-3-030-04651-4/ebook). Lecture Notes in Computer Science 11346, 421-435 (2018).
MSC:  68T20 90C27
PDF BibTeX XML Cite
\textit{R. R. Madireddy} et al., Lect. Notes Comput. Sci. 11346, 421--435 (2018; Zbl 07116396)
Full Text: DOI
Khachai, M. Yu.; Neznakhina, E. D.
Approximation schemes for the generalized traveling salesman problem. (English. Russian original) Zbl 1390.68764
Proc. Steklov Inst. Math. 299, Suppl. 1, S97-S105 (2017); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 22, No. 3, 283-292 (2016).
MSC:  68W25 68Q17 90C27
PDF BibTeX XML Cite
\textit{M. Yu. Khachai} and \textit{E. D. Neznakhina}, Proc. Steklov Inst. Math. 299, S97--S105 (2017; Zbl 1390.68764); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 22, No. 3, 283--292 (2016)
Full Text: DOI
Bredereck, Robert; Froese, Vincent; Koseler, Marcel; Millani, Marcelo Garlet; Nichterlein, André; Niedermeier, Rolf
A parameterized algorithmics framework for degree sequence completion problems in directed graphs. (English) Zbl 1398.68219
Guo, Jiong (ed.) et al., 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-023-1). LIPIcs – Leibniz International Proceedings in Informatics 63, Article 10, 14 p. (2017).
MSC:  68Q25 05C07 05C20 68Q17 68R10
PDF BibTeX XML Cite
\textit{R. Bredereck} et al., LIPIcs -- Leibniz Int. Proc. Inform. 63, Article 10, 14 p. (2017; Zbl 1398.68219)
Full Text: DOI
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav
Group activity selection on graphs: parameterized analysis. (English) Zbl 1403.91068
Bilò, Vittorio (ed.) et al., Algorithmic game theory. 10th international symposium, SAGT 2017, L’Aquila, Italy, September 12–14, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-66699-0/pbk; 978-3-319-66700-3/ebook). Lecture Notes in Computer Science 10504, 106-118 (2017).
MSC:  91A43 68Q17
PDF BibTeX XML Cite
\textit{S. Gupta} et al., Lect. Notes Comput. Sci. 10504, 106--118 (2017; Zbl 1403.91068)
Full Text: DOI
Courtois, Nicolas T.
Two philosophies for solving non-linear equations in algebraic cryptanalysis. (English) Zbl 1410.94059
Phan, Raphael C.-W. (ed.) et al., Paradigms in cryptology – Mycrypt 2016. Malicious and exploratory cryptology. Second international conference, Mycrypt 2016, Kuala Lumpur, Malaysia, December 1–2, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10311, 506-520 (2017).
MSC:  94A60
PDF BibTeX XML Cite
\textit{N. T. Courtois}, Lect. Notes Comput. Sci. 10311, 506--520 (2017; Zbl 1410.94059)
Full Text: DOI
Galashov, A. E.; Kel’manov, A. V.
Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets. (Russian, English) Zbl 1374.68499
Sib. Zh. Vychisl. Mat. 20, No. 1, 15-22 (2017); translation in Numer. Analysis Appl. 10, No. 1, 11-16 (2017).
MSC:  68T20 62H30 68Q17
PDF BibTeX XML Cite
\textit{A. E. Galashov} and \textit{A. V. Kel'manov}, Sib. Zh. Vychisl. Mat. 20, No. 1, 15--22 (2017; Zbl 1374.68499); translation in Numer. Analysis Appl. 10, No. 1, 11--16 (2017)
Full Text: DOI
Plotnikov, Roman; Erzin, Adil; Mladenovic, Nenad
Variable neighborhood search-based heuristics for MIN-power symmetric connectivity problem in wireless networks. (English) Zbl 1385.90005
Kochetov, Yury (ed.) et al., Discrete optimization and operations research. 9th international conference, DOOR 2016, Vladivostok, Russia, September 19–23, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44913-5/pbk; 978-3-319-44914-2/ebook). Lecture Notes in Computer Science 9869, 220-232 (2016).
MSC:  90B10 90B50 90C59
PDF BibTeX XML Cite
\textit{R. Plotnikov} et al., Lect. Notes Comput. Sci. 9869, 220--232 (2016; Zbl 1385.90005)
Full Text: DOI
Fertin, Guillaume; Komusiewicz, Christian
Graph motif problems parameterized by dual. (English) Zbl 1382.68106
Grossi, Roberto (ed.) et al., 27th annual symposium on combinatorial pattern matching, CPM 2016, Tel Aviv, Israel, June 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-012-5). LIPIcs – Leibniz International Proceedings in Informatics 54, Article 7, 12 p. (2016).
MSC:  68Q25 05C15 68Q17 68R10
PDF BibTeX XML Cite
\textit{G. Fertin} and \textit{C. Komusiewicz}, LIPIcs -- Leibniz Int. Proc. Inform. 54, Article 7, 12 p. (2016; Zbl 1382.68106)
Full Text: DOI arXiv
Dolgushev, A. V.; Kel’manov, A. V.; Shenmaier, V. V.
Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters. (English. Russian original) Zbl 1362.68292
Proc. Steklov Inst. Math. 295, Suppl. 1, S47-S56 (2016); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 21, No. 3, 100-109 (2015).
MSC:  68W25 62H30 68Q17
PDF BibTeX XML Cite
\textit{A. V. Dolgushev} et al., Proc. Steklov Inst. Math. 295, S47--S56 (2016; Zbl 1362.68292); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 21, No. 3, 100--109 (2015)
Full Text: DOI
Chentsov, A. G.; Khachai, M. Yu.; Khachai, D. M.
An exact algorithm with linear complexity for a problem of visiting megalopolises. (English. Russian original) Zbl 1375.90247
Proc. Steklov Inst. Math. 295, Suppl. 1, S38-S46 (2016); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 21, No. 3, 309-317 (2015).
MSC:  90C27 90C39
PDF BibTeX XML Cite
\textit{A. G. Chentsov} et al., Proc. Steklov Inst. Math. 295, S38--S46 (2016; Zbl 1375.90247); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 21, No. 3, 309--317 (2015)
Full Text: DOI
van Bevern, René; Pyatkin, Artem V.
Completing partial schedules for open shop with unit processing times and routing. (English) Zbl 06605920
Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-34170-5/pbk; 978-3-319-34171-2/ebook). Lecture Notes in Computer Science 9691, 73-87 (2016).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{R. van Bevern} and \textit{A. V. Pyatkin}, Lect. Notes Comput. Sci. 9691, 73--87 (2016; Zbl 06605920)
Full Text: DOI
van Bevern, René; Froese, Vincent; Komusiewicz, Christian
Parameterizing edge modification problems above lower bounds. (English) Zbl 1386.68074
Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-34170-5/pbk; 978-3-319-34171-2/ebook). Lecture Notes in Computer Science 9691, 57-72 (2016).
MSC:  68Q25 68Q17 68R10
PDF BibTeX XML Cite
\textit{R. van Bevern} et al., Lect. Notes Comput. Sci. 9691, 57--72 (2016; Zbl 1386.68074)
Full Text: DOI
Kel’manov, A. V.; Pyatkin, Artem V.
On the complexity of some quadratic Euclidean 2-clustering problems. (English. Russian original) Zbl 1362.68092
Comput. Math. Math. Phys. 56, No. 3, 491-497 (2016); translation from Zh. Vychisl. Mat. Mat. Fiz. 56, No. 3, 498-504 (2016).
MSC:  68Q17 90C59
PDF BibTeX XML Cite
\textit{A. V. Kel'manov} and \textit{A. V. Pyatkin}, Comput. Math. Math. Phys. 56, No. 3, 491--497 (2016; Zbl 1362.68092); translation from Zh. Vychisl. Mat. Mat. Fiz. 56, No. 3, 498--504 (2016)
Full Text: DOI
van Bevern, René; Komusiewicz, Christian; Sorge, Manuel
Approximation algorithms for mixed, windy, and capacitated arc routing problems. (English) Zbl 1432.90024
Italiano, Giuseppe F. (ed.) et al., 15th workshop on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS’15, Patras, Greece, September 17, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 48, 130-143 (2015).
MSC:  90B06 90C59 90C27
PDF BibTeX XML Cite
\textit{R. van Bevern} et al., OASIcs -- OpenAccess Ser. Inform. 48, 130--143 (2015; Zbl 1432.90024)
Full Text: DOI
Hermelin, Danny; Kaspi, Moshe; Komusiewicz, Christian; Navon, Barak
Parameterized complexity of critical node cuts. (English) Zbl 1378.68081
Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 343-354 (2015).
MSC:  68Q25 68Q17 68R10
PDF BibTeX XML Cite
\textit{D. Hermelin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 343--354 (2015; Zbl 1378.68081)
Full Text: DOI
Salmela, Leena; Sahlin, Kristoffer; Mäkinen, Veli; Tomescu, Alexandru
Gap filling as exact path length problem. (English) Zbl 1355.92033
Przytycka, Teresa M. (ed.), Research in computational molecular biology. 19th annual international conference, RECOMB 2015, Warsaw, Poland, April 12–15, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-16705-3/pbk; 978-3-319-16706-0/ebook). Lecture Notes in Computer Science 9029. Lecture Notes in Bioinformatics, 281-292 (2015).
MSC:  92C40 05C90 68Q15
PDF BibTeX XML Cite
\textit{L. Salmela} et al., Lect. Notes Comput. Sci. 9029, 281--292 (2015; Zbl 1355.92033)
Full Text: DOI
Komusiewicz, Christian; Radulescu, Andreea
On the sound covering cycle problem in paired de Bruijn graphs. (English) Zbl 1408.05109
Wang, Jianxin (ed.) et al., Frontiers in algorithmics. 9th international workshop, FAW 2015, Guilin, China, July 3–5, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9130, 150-161 (2015).
MSC:  05C70 05C38 05C85
PDF BibTeX XML Cite
\textit{C. Komusiewicz} and \textit{A. Radulescu}, Lect. Notes Comput. Sci. 9130, 150--161 (2015; Zbl 1408.05109)
Full Text: DOI
Khachai, M. Yu.; Neznakhina, E. D.
A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph. (English. Russian original) Zbl 1409.05158
Proc. Steklov Inst. Math. 289, Suppl. 1, S111-S125 (2015); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 20, No. 4, 297-311 (2014).
MSC:  05C70 05C22 05C85 68W25 90C27 90C60
PDF BibTeX XML Cite
\textit{M. Yu. Khachai} and \textit{E. D. Neznakhina}, Proc. Steklov Inst. Math. 289, S111--S125 (2015; Zbl 1409.05158); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 20, No. 4, 297--311 (2014)
Full Text: DOI

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
all top 3
Software