×

Found 462 Documents (Results 1–100)

Set selection under explorable stochastic uncertainty via covering techniques. (English) Zbl 1528.90169

Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 319-333 (2023).
MSC:  90C15 90C10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Configuration balancing for stochastic requests. (English) Zbl 1528.90112

Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 127-141 (2023).
MSC:  90B36 90C15 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Inapproximability of shortest paths on perfect matching polytopes. (English) Zbl 07763008

Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 72-86 (2023).
MSC:  90C35
PDFBibTeX XMLCite
Full Text: DOI arXiv

Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines. (English) Zbl 1528.90111

Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 324-335 (2022).
MSC:  90B35 90B10 90C60
PDFBibTeX XMLCite
Full Text: DOI

Two-agent scheduling with resource augmentation on multiple machines. (English) Zbl 1512.68042

Cano, José (ed.) et al., Euro-Par 2022: parallel processing. 28th international conference on parallel and distributed computing, Glasgow, UK, August 22–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13440, 253-267 (2022).
MSC:  68M20 68W27 90B35
PDFBibTeX XMLCite
Full Text: DOI

Heterogeneous flow distribution at the peak load in the multiuser network. (English. Russian original) Zbl 1498.90047

J. Comput. Syst. Sci. Int. 61, No. 3, 372-387 (2022); translation from Izv. Ross. Akad. Nauk, Teor. Sist. Upr. 2022, No. 3, 81-96 (2022).
MSC:  90B18
PDFBibTeX XMLCite
Full Text: DOI

Non-adaptive stochastic score classification and explainable halfspace evaluation. (English) Zbl 1497.90138

Aardal, Karen (ed.) et al., Integer programming and combinatorial optimization. 23rd international conference, IPCO 2022, Eindhoven, The Netherlands, June 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13265, 277-290 (2022).
MSC:  90C15 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

An improved approximation algorithm for squared metric \(k\)-facility location. (English) Zbl 07550550

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, 538-552 (2021).
MSC:  68T20 90C27
PDFBibTeX XMLCite
Full Text: DOI

Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. (English) Zbl 1482.90232

Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 326-339 (2021).
MSC:  90C35 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

Robust \(k\)-center with two types of radii. (English) Zbl 1482.90178

Singh, Mohit (ed.) et al., Integer programming and combinatorial optimization. 22nd international conference, IPCO 2021, Atlanta, GA, USA, May 19–21, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12707, 268-282 (2021).
MSC:  90C27 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

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).
PDFBibTeX XMLCite
Full Text: DOI

Polylogarithmic approximation algorithm for \(k\)-connected directed Steiner tree on quasi-bipartite graphs. (English) Zbl 07758365

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 63, 20 p. (2020).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

On perturbation resilience of non-uniform \(k\)-center. (English) Zbl 07758333

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 31, 22 p. (2020).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI

Streaming verification for graph problems: optimal tradeoffs and nonlinear sketches. (English) Zbl 07758324

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 22, 23 p. (2020).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Testable properties in general graphs and random order streaming. (English) Zbl 07758318

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 16, 20 p. (2020).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Palette sparsification beyond \((\Delta +1)\) vertex coloring. (English) Zbl 07758308

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 6, 22 p. (2020).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software