×

Found 2,143 Documents (Results 1–100)

A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring. (English. Russian original) Zbl 1521.90073

Autom. Remote Control 84, No. 2, 167-186 (2023); translation from Avtom. Telemekh. 2023, No. 1, 139-168 (2023).
MSC:  90B35 68M20 05C85
PDFBibTeX XMLCite
Full Text: DOI

Network connectivity. Concepts, computation, and optimization. (English) Zbl 1481.68006

Synthesis Lectures on Learning, Networks, and Algorithms 28. San Rafael, CA: Morgan & Claypool Publishers (ISBN 978-1-63639-295-0; 978-1-63639-296-7/ebook). xiii, 151 p. (2022).
PDFBibTeX XMLCite
Full Text: DOI

Hitting weighted even cycles in planar graphs. (English) Zbl 1528.68290

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 25, 23 p. (2021).
PDFBibTeX XMLCite
Full Text: DOI

Maximizing energy efficiency for charger scheduling of WRSNs. (English) Zbl 1498.68039

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 111-122 (2021).
PDFBibTeX XMLCite
Full Text: DOI

On the maximal cut in a random hypergraph. (English. Russian original) Zbl 1486.05283

Dokl. Math. 104, No. 3, 336-339 (2021); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 501, 26-30 (2021).
PDFBibTeX XMLCite
Full Text: DOI

The complexity of flow expansion and electrical flow expansion. (English) Zbl 1490.90084

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 431-441 (2021).
PDFBibTeX XMLCite
Full Text: DOI Link

Total chromatic sum for trees. (English) Zbl 1479.05111

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 27-37 (2021).
PDFBibTeX XMLCite
Full Text: DOI

On list \(k\)-coloring convex bipartite graphs. (English) Zbl 1479.05100

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 15-26 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The chromatic polynomial of a digraph. (English) Zbl 1479.05163

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 1-14 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximation algorithms for the single robot line coverage problem. (English) Zbl 1469.68119

Lavalle, Steven M. (ed.) et al., Algorithmic foundations of robotics XIV. Proceedings of the fourteenth workshop on the algorithmic foundations of robotics. Cham: Springer. Springer Proc. Adv. Robot. 17, 534-550 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software