Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Segev, Danny"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximation algorithms for orienting mixed graphs
Michael Elberfeld
,
Danny Segev
,
Colin R. Davidson
,
Dana Silverbush
,
Roded Sharan
Theoretical Computer Science
483
, 2013, pp. 96-103
Improved bounds for online preemptive matching
Leah Epstein
,
Asaf Levin
,
Danny Segev
,
Oren Weimann
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 389-399
Approximation algorithms and hardness results for shortest path based graph orientations
Dima Blokh
,
Danny Segev
,
Roded Sharan
Lecture Notes in Computer Science
7354
, 2012, pp. 70-82
Approximation algorithms for orienting mixed graphs
Michael Elberfeld
,
Danny Segev
,
Colin R. Davidson
,
Dana Silverbush
,
Roded Sharan
Lecture Notes in Computer Science
6661
, 2011, pp. 416-428
Improved approximation guarantees for weighted matching in the semi-streaming model
Leah Epstein
,
Asaf Levin
,
Julian Mestre
,
Danny Segev
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1251-1265
A unified approach to approximating partial covering problems
Jochen Könemann
,
Ojas Parekh
,
Danny Segev
Algorithmica
59
(4), 2011, pp. 489-509
Improved approximation guarantees for weighted matching in the semi-streaming model
Leah Epstein
,
Asaf Levin
,
Julián Mestre
,
Danny Segev
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 347-358
A polylogarithmic approximation for computing non-metric terminal Steiner trees
Iftah Gamzu
,
Danny Segev
Information Processing Letters
110
(18-19), 2010, pp. 826-829
A sublogarithmic approximation for highway and tollbooth pricing
Iftah Gamzu
,
Danny Segev
Lecture Notes in Computer Science
6198
, 2010, pp. 582-593
The complexity of bottleneck labeled graph problems
Refael Hassin
,
Jérôme Monnot
,
Danny Segev
Algorithmica
58
(2), 2010, pp. 245-262
Approximate
k
-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Danny Segev
,
Gil Segev
Algorithmica
56
(4), 2010, pp. 529-549
Path hitting in acyclic graphs
Ojas Parekh
,
Danny Segev
Algorithmica
52
(4), 2008, pp. 466-486
Improved online algorithms for the sorting buffer problem
Iftah Gamzu
,
Danny Segev
Lecture Notes in Computer Science
4393
, 2007, pp. 658-669
The complexity of bottleneck labeled graph problems
Refael Hassin
,
Jérôme Monnot
,
Danny Segev
Lecture Notes in Computer Science
4769
, 2007, pp. 328-340
Approximation algorithms and hardness results for labeled connectivity problems
Refael Hassin
,
Jérôme Monnot
,
Danny Segev
Lecture Notes in Computer Science
4162
, 2006, pp. 480-491
A unified approach to approximating partial covering problems
Jochen Könemann
,
Ojas Parekh
,
Danny Segev
Lecture Notes in Computer Science
4168
, 2006, pp. 468-479
Partial multicuts in trees
Asaf Levin
,
Danny Segev
Theoretical Computer Science
369
(1-3), 2006, pp. 384-395
Path hitting in acyclic graphs
Ojas Parekh
,
Danny Segev
Lecture Notes in Computer Science
4168
, 2006, pp. 564-575
Approximate
k
-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
Danny Segev
,
Gil Segev
Lecture Notes in Computer Science
4168
, 2006, pp. 600-611
The multi-radius cover problem
Refael Hassin
,
Danny Segev
Lecture Notes in Computer Science
3608
, 2005, pp. 24-35
The set cover with pairs problem
Refael Hassin
,
Danny Segev
Lecture Notes in Computer Science
3821
, 2005, pp. 164-176
Robust subgraphs for trees and paths
Refael Hassin
,
Danny Segev
Lecture Notes in Computer Science
3111
, 2004, pp. 51-63