BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Japan
1 × Portugal
3 × USA
Collaborated with:
R.Ravi S.Leonardi G.Schäfer A.E.Feldmann W.S.Fung I.Post L.Fleischer S.H.M.v.Zwam
Talks about:
degre (3) bound (3) approxim (2) steiner (2) primal (2) share (2) graph (2) tree (2) dual (2) cost (2)

Person: Jochen Könemann

DBLP DBLP: K=ouml=nemann:Jochen

Contributed to:

ICALP (1) 20152015
STOC 20062006
ICALP 20052005
STOC 20032003
STOC 20002000

Wrote 5 papers:

ICALP-v1-2015-FeldmannFKP #bound #graph
A (1+ε ) ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (AEF, WSF, JK, IP), pp. 469–480.
STOC-2006-FleischerKLS #multi #probability
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (LF, JK, SL, GS), pp. 663–670.
ICALP-2005-KonemannLSZ #problem
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem (JK, SL, GS, SHMvZ), pp. 930–942.
STOC-2003-KonemannR #approximate #bound
Primal-dual meets local search: approximating MST’s with nonuniform degree bounds (JK, RR), pp. 389–395.
STOC-2000-KonemannR #algorithm #approximate #bound #matter
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.