Výsledky vyhľadávania - "Quasi-polynomial algorithm"

Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs Autor Elbassioni, Khaled

“…A hypergraph H on n vertices and m edges is said to be nearly-intersecting if every edge of H intersects all but at most polylogarthmically many (in m and n)…”
Získať plný text

Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game Autor Etesami, Seyed Rasoul, Başar, Tamer

“…We consider the capacitated selfish replication (CSR) game with binary preferences, over general undirected networks. We study the price of anarchy of such…”
Získať plný text

An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game Autor Etesami, Seyed Rasoul, Basar, Tamer

“…We consider in this paper a simple model for human interactions as service providers of different resources over social networks, and study the dynamics of…”
Získať plný text

Priority Promotion with Parysian flair Autor Benerecetti, Massimo, Dell'Erba, Daniele, Mogavero, Fabio, Schewe, Sven, Wojtczak, Dominik

“…We develop an algorithm that combines the advantages of Priority Promotion, that is one of the leading approaches to solving large parity games in practice,…”
Získať plný text

Smaller progress measures and separating automata for parity games Autor Dell'Erba, Daniele, Schewe, Sven

“…Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to several approaches with…”
Získať plný text

List Partitions Autor Feder, Tomas, Hell, Pavol, Klein, Sulamita, Motwani, Rajeev

“…List partitions generalize list colorings and list homomorphisms. (We argue that they may be called list "semihomomorphisms.") Each symmetric matrix M over…”
Získať plný text