Sciweavers

MST
2016
62views Hardware» more  MST 2016»
10 years 3 months ago
Approximating the Sparsest k-Subgraph in Chordal Graphs
Rémi Watrigant, Marin Bougeret, Rodolphe Gi...
MST
2016
113views Hardware» more  MST 2016»
10 years 3 months ago
Online Knapsack Revisited
Marek Cygan, Lukasz Jez, Jirí Sgall
MST
2016
89views Hardware» more  MST 2016»
10 years 3 months ago
Min-Sum 2-Paths Problems
An orientation of an undirected graph G is a directed graph obtained by replacing each edge {u, v} of G by exactly one of the arcs (u, v) or (v, u). In the min-sum k-paths orienta...
Trevor I. Fenner, Oded Lachish, Alexandru Popa
MST
2016
73views Hardware» more  MST 2016»
10 years 3 months ago
Reducibilities Relating to Schnorr Randomness
Abstract Some measures of randomness have been introduced for MartinL¨of randomness such as K-reducibility, C-reducibility and vL-reducibility. In this paper we study Schnorr-rand...
Kenshi Miyabe
MSCS
2016
95views Robotics» more  MSCS 2016»
10 years 3 months ago
Fair subtyping for multi-party session types
The standard subtyping relation used in dyadic session type theories may compromise the liveness of multi-party sessions. In this paper we define a fair subtyping relation for mul...
Luca Padovani