×

Found 866 Documents (Results 1–100)

100
MathJax

On finding separators in temporal split and permutation graphs. (English) Zbl 07530247

Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 385-398 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

On minimum generalized Manhattan connections. (English) Zbl 07498670

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 85-100 (2021).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

The minimum moving spanning tree problem. (English) Zbl 07498665

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 15-28 (2021).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Minimizing total completion time in multiprocessor job systems with energy constraint. (English) Zbl 07495085

Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 267-279 (2021).
MSC:  90B35 68M20 68W25
PDF BibTeX XML Cite
Full Text: DOI

Algorithms and complexity of \(s\)-club cluster vertex deletion. (English) Zbl 07495020

Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 152-164 (2021).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Approximation and complexity of the capacitated geometric median problem. (English) Zbl 07493546

Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 422-434 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability. (English. Russian original) Zbl 07377486

Proc. Steklov Inst. Math. 313, Suppl. 1, S117-S124 (2021); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 25, No. 4, 69-78 (2019).
MSC:  68W25
PDF BibTeX XML Cite
Full Text: DOI

Approximation algorithms for balancing signed graphs. (English) Zbl 1482.68172

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, 399-410 (2020).
PDF BibTeX XML Cite
Full Text: DOI

On the complexity of directed intersection representation of DAGs. (English) Zbl 07336134

Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 554-565 (2020).
MSC:  68Rxx
PDF BibTeX XML Cite
Full Text: DOI

Computational complexity characterization of protecting elections from bribery. (English) Zbl 07336096

Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 85-97 (2020).
MSC:  68Rxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Easy NP-hardness proofs of some subset choice problems. (English) Zbl 1460.90156

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, 70-79 (2020).
MSC:  90C27 90C60
PDF BibTeX XML Cite
Full Text: DOI

Maximum bipartite subgraph of geometric intersection graphs. (English) Zbl 07224281

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, 158-169 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

The generalized dependency constrained spanning tree problem. (English) Zbl 07515224

Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 711-723 (2019).
MSC:  05Cxx 90Cxx
PDF BibTeX XML Cite
Full Text: DOI

NP-hardness of some max-min clustering problems. (English) Zbl 1468.90110

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, 144-154 (2019).
MSC:  90C27 90C60
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

Biographic Reference