×

Found 40 Documents (Results 1–40)

Improved analysis of online balanced clustering. (English) Zbl 07603894

Koenemann, Jochen (ed.) et al., Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12982, 224-233 (2021).
MSC:  68W25 68W27

Generating all patterns of graph partitions within a disparity bound. (English) Zbl 1485.68189

Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 119-131 (2017).
Full Text: DOI

Approximating minimum \(k\)-section in trees with linear diameter. (English) Zbl 1347.05032

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 71-76, electronic only (2015).

On minimum bisection and related partition problems in graphs with bounded tree width. (English) Zbl 1346.05229

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 481-488, electronic only (2015).
MSC:  05C70 05C12
Full Text: DOI

New insight into 2-community structures in graphs with applications in social networks. (English) Zbl 1478.05115

Lu, Zaixin (ed.) et al., Combinatorial optimization and applications. 9th international conference, COCOA 2015, Houston, TX, USA, December 18–20, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9486, 236-250 (2015).

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field