×

Found 1,439 Documents (Results 1–100)

100
MathJax

Finding geometric representations of apex graphs is NP-hard. (English) Zbl 07556569

Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 161-174 (2022).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Single machine scheduling with rejection and generalized parameters. (English) Zbl 07550528

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 234-246 (2021).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. (English) Zbl 07550518

Du, Ding-Zhu (ed.) et al., Combinatorial optimization and applications. 15th international conference, COCOA 2021, Tianjin, China, December 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13135, 111-124 (2021).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

Cyclic shift problems on graphs. (English) Zbl 07405971

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 308-320 (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the geometric red-blue set cover problem. (English) Zbl 07405957

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 129-141 (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines. (English. Russian original) Zbl 1470.90040

Proc. Steklov Inst. Math. 313, Suppl. 1, S58-S72 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 26, No. 2, 108-124 (2020).
PDF BibTeX XML Cite
Full Text: DOI

Complexity of computing the anti-Ramsey numbers for paths. (English) Zbl 07559377

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 6, 14 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

On PTAS for the geometric maximum connected \(k\)-factor problem. (English) Zbl 1477.90083

Jaćimović, Milojica (ed.) et al., Optimization and applications. 10th international conference, OPTIMA 2019, Petrovac, Montenegro, September 30 – October 4, 2019. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1145, 194-205 (2020).
MSC:  90C27 90C35
PDF BibTeX XML Cite
Full Text: DOI

Improved hardness and approximation results for single allocation hub location. (English) Zbl 1482.68187

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 85-96 (2020).
PDF BibTeX XML Cite
Full Text: DOI

Exact algorithm for the one-dimensional quadratic Euclidean cardinality-weighted 2-clustering with given center problem. (English) Zbl 1460.90152

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. Commun. Comput. Inf. Sci. 1275, 30-35 (2020).
MSC:  90C27
PDF BibTeX XML Cite
Full Text: DOI

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. Lect. Notes Comput. Sci. 11974, 400-405 (2020).
MSC:  65-XX
PDF BibTeX XML Cite
Full Text: DOI

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. Lect. Notes Comput. Sci. 11974, 386-393 (2020).
MSC:  65-XX
PDF BibTeX XML Cite
Full Text: DOI

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. Lect. Notes Comput. Sci. 12049, 146-157 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

The unbearable hardness of unknotting. (English) Zbl 07559249

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 49, 19 p. (2019).
MSC:  68U05
PDF BibTeX XML Cite
Full Text: DOI

An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem. (English) Zbl 1468.90109

Evtushenko, Yury (ed.) et al., Optimization and applications. 9th international conference, OPTIMA 2018, Petrovac, Montenegro, October 1–5, 2018. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 974, 131-143 (2019).
MSC:  90C27
PDF BibTeX XML Cite
Full Text: DOI

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
Full Text: DOI

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
Full Text: DOI

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
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