×

Found 126 Documents (Results 1–100)

Constant-competitiveness for random assignment matroid secretary without knowing the matroid. (English) Zbl 1528.91023

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, 423-437 (2023).
MSC:  91A60 68W27

Formal barriers to simple algorithms for the matroid secretary problem. (English) Zbl 1533.68411

Feldman, Michal (ed.) et al., Web and internet economics. 17th international conference, WINE 2021, Potsdam, Germany, December 14–17, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13112, 280-298 (2022).

On guillotine separability of squares and rectangles. (English) Zbl 07758349

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 47, 22 p. (2020).
MSC:  68W20 68W25 90C27
Full Text: DOI

Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs. (English) Zbl 07758319

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 17, 21 p. (2020).
MSC:  68W20 68W25 90C27
Full Text: DOI

Online bin covering with limited migration. (English) Zbl 07525455

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 18, 14 p. (2019).
MSC:  68Wxx

Approximating dominating set on intersection graphs of rectangles and L-frames. (English) Zbl 1512.68400

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 37, 15 p. (2018).

A spectral partitioning algorithm for maximum directed cut problem. (English) Zbl 1470.68064

Gao, Xiaofeng (ed.) et al., Combinatorial optimization and applications. 11th international conference, COCOA 2017, Shanghai, China, December 16–18, 2017. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 10627, 298-312 (2017).
Full Text: DOI

Subquadratic submodular function minimization. (English) Zbl 1370.90206

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 1220-1231 (2017).
MSC:  90C27 90C59 90C60

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software