SOFSEM 2009 | Sciweavers

We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: ﬁrst, we construct a gadget without the desir...

Nguyen Kim Thang

claim paper

Read More »

4

click to vote

SOFSEM
2009
Springer

97views Theoretical Computer Science» more SOFSEM 2009»

Conjunctive Grammars with Restricted Disjunction

14 years 1 months ago

Download tucs.fi

Alexander Okhotin, Christian Reitwießner

claim paper

Read More »

11

click to vote

SOFSEM
2009
Springer

96views Theoretical Computer Science» more SOFSEM 2009»

The Shortcut Problem - Complexity and Approximation

14 years 1 months ago

Download i11www.iti.uni-karlsruhe.de

During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...

Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...

claim paper

Read More »

9

click to vote

SOFSEM
2009
Springer

100views Theoretical Computer Science» more SOFSEM 2009»

Improved Algorithms for the 2-Vertex Disjoint Paths Problem

14 years 1 months ago

Download www.sofsem.cz

Torsten Tholey

claim paper