NON-REDUCTIVE AUTOMORPHISM GROUPS, THE LOEWY FILTRATION AND K-STABILITY (vol 66, pg 1895, 2016)

Giulio Codogni
2018
Journal Articles

Source officielle

À propos
Confidentialité
Mentions légales

Graph Chatbot

Giulio Codogni
2018
Journal Articles

Source officielle

Publications associées (4)

Afficher plus

https://infoscience.epfl.ch/entities/publication/5737c07b-2bbd-46b7-9de8-a4cc3c1a1c85

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (4)

Afficher plus

Disagreement and fragmentation in growing groups

Jiyong Zhang, Yubo Xie

The arise of disagreement is an emergent phenomenon that can be observed within a growing social group and, beyond a certain threshold, can lead to group fragmentation. To better understand how disagreement emerges, we introduce an analytically tractable m ...

PERGAMON-ELSEVIER SCIENCE LTD2023

A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem

Ola Nils Anders Svensson, Etienne Michel François Bamas, Marina Rebekah Rosie Drygala

The Matching Augmentation Problem (MAP) has recently received significant attention as an important step towards better approximation algorithms for finding cheap 2-edge connected subgraphs. This has culminated in a 5/3-approximation algorithm. However, th ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

A Quasi-Polynomial Approximation For The Restricted Assignment Problem

Lars Rohwedder

The RESTRICTED ASSIGNMENT problem is a prominent special case of SCHEDULING ON UNRELATED PARALLEL MACHINES. For the strongest known linear programming relaxation, the configuration LP, we improve the nonconstructive bound on its integrality gap from 1.9412 ...

SIAM PUBLICATIONS2020