14 research outputs found
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
From subexponential distributions to black swan dominance
The shape of empirical distributions with heavy tails is a recurrent matter
of debate. There are claims of a power laws and the associated scale
invariance. There are plenty of challengers as well, the lognormal and
stretched exponential among others. Here I point out that, with regard to
summation invariance, all what matters is they are subexponential
distributions. I provide numerical examples highlighting the key properties of
subexponential distributions. The summation invariance and the black swan
dominance: the sum is dominated by the maximum. Finally, I illustrate the use
of these properties to tackle problems in random networks, infectious dynamics
and project delays.Comment: 6 pages, 3 figure
Approximation algorithms for network design and cut problems in bounded-treewidth
This thesis explores two optimization problems, the group Steiner tree and firefighter problems, which are known to be NP-hard even on trees. We study the approximability of these problems on trees and bounded-treewidth graphs. In the group Steiner tree, the input is a graph and sets of vertices called groups; the goal is to choose one representative from each group and connect all the representatives with minimum cost. We show an O(log^2 n)-approximation algorithm for bounded-treewidth graphs, matching the known lower bound for trees, and improving the best possible result using previous techniques. We also show improved approximation results for group Steiner forest, directed Steiner forest, and a fault-tolerant version of group Steiner tree. In the firefighter problem, we are given a graph and a vertex which is burning. At each time step, we can protect one vertex that is not burning; fire then spreads to all unprotected neighbors of burning vertices. The goal is to maximize the number of vertices that the fire does not reach. On trees, a classic (1-1/e)-approximation algorithm is known via LP rounding. We prove that the integrality gap of the LP matches this approximation, and show significant evidence that additional constraints may improve its integrality gap. On bounded-treewidth graphs, we show that it is NP-hard to find a subpolynomial approximation even on graphs of treewidth 5. We complement this result with an O(1)-approximation on outerplanar graphs.Diese Arbeit untersucht zwei Optimierungsprobleme, von welchen wir wissen, dass sie selbst in Bäumen NP-schwer sind. Wir analysieren Approximationen für diese Probleme in Bäumen und Graphen mit begrenzter Baumweite. Im Gruppensteinerbaumproblem, sind ein Graph und Mengen von Knoten (Gruppen) gegeben; das Ziel ist es, einen Knoten von jeder Gruppe mit minimalen Kosten zu verbinden. Wir beschreiben einen O(log^2 n)-Approximationsalgorithmus für Graphen mit beschränkter Baumweite, dies entspricht der zuvor bekannten unteren Schranke für Bäume und ist zudem eine Verbesserung über die bestmöglichen Resultate die auf anderen Techniken beruhen. Darüber hinaus zeigen wir verbesserte Approximationsresultate für andere Gruppensteinerprobleme. Im Feuerwehrproblem sind ein Graph zusammen mit einem brennenden Knoten gegeben. In jedem Zeitschritt können wir einen Knoten der noch nicht brennt auswählen und diesen vor dem Feuer beschützen. Das Feuer breitet sich anschließend zu allen Nachbarn aus. Das Ziel ist es die Anzahl der Knoten die vom Feuer unberührt bleiben zu maximieren. In Bäumen existiert ein lang bekannter (1-1/e)-Approximationsalgorithmus der auf LP Rundung basiert. Wir zeigen, dass die Ganzzahligkeitslücke des LP tatsächlich dieser Approximation entspricht, und dass weitere Einschränkungen die Ganzzahligkeitslücke möglicherweise verbessern könnten. Für Graphen mit beschränkter Baumweite zeigen wir, dass es NP-schwer ist, eine sub-polynomielle Approximation zu finden
NOTIFICATION!!!
The full content of this special edition is retrieved from the conference proceedings published by the European Scientific Institute, ESI. http://eujournal.org/index.php/esj/pages/view/books The European Scientific Journal, ESJ, after approval from the publisher re publishes the papers in a Special edition
NOTIFICATION !!!
All the content of this special edition is retrieved from the conference proceedings published by the European Scientific Institute, ESI. http://eujournal.org/index.php/esj/pages/view/books The European Scientific Journal, ESJ, after approval from the publisher re publishes the papers in a Special edition
Advances in knowledge discovery and data mining Part II
19th Pacific-Asia Conference, PAKDD 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part II</p
NOTIFICATION !!!
All the content of this special edition is retrieved from the conference proceedings published by the European Scientific Institute, ESI. http://eujournal.org/index.php/esj/pages/view/books The European Scientific Journal, ESJ, after approval from the publisher re publishes the papers in a Special edition
NOTIFICATION !!!
All the content of this special edition is retrieved from the conference proceedings published by the European Scientific Institute, ESI. http://eujournal.org/index.php/esj/pages/view/books The European Scientific Journal, ESJ, after approval from the publisher re publishes the papers in a Special edition
NOTIFICATION !!!
All the content of this special edition is retrieved from the conference proceedings published by the European Scientific Institute, ESI. http://eujournal.org/index.php/esj/pages/view/books The European Scientific Journal, ESJ, after approval from the publisher re publishes the papers in a Special edition
NOTIFICATION !!!
All the content of this special edition is retrieved from the conference proceedings published by the European Scientific Institute, ESI. http://eujournal.org/index.php/esj/pages/view/books The European Scientific Journal, ESJ, after approval from the publisher re publishes the papers in a Special edition