MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Danny Segev" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

10 documents found, showing 1 through 10.

ATOM

Rounding to an integral program
by Refael Hassin, Danny Segev — 2005 — In Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA’05
…Rounding to an Integral Program ⋆ Refael Hassin and Danny Segev School of Mathematical Sciences…
Cited by 5 (0 self) – Add To MetaCart

The multi-radius cover problem
by Refael Hassin, Danny Segev — 2005 — In Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS’05
…The Multi-Radius Cover Problem Refael Hassin and Danny Segev School of Mathematical Sciences, Tel…
Cited by 2 (1 self) – Add To MetaCart

The set cover with pairs problem
by Refael Hassin, Danny Segev — 2005 — In: Proc. 25th Annual Conference on Foundations of Software Technology and Theoretical Computer Science
…The Set Cover with Pairs Problem ⋆ Refael Hassin and Danny Segev School of Mathematical Sciences…
Cited by 3 (1 self) – Add To MetaCart

Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
by Danny Segev, Gil Segev — 2006 — In 14th Annual European Symposium on Algorithms
… ∗ Danny Segev † Gil Segev ‡ Abstract An instance of the k-Steiner forest problem consists of an undirected…
Cited by 1 (0 self) – Add To MetaCart

Partial multicuts in trees
by Asaf Levin, Danny Segev — 2005 — In Proceedings of the 3rd International Workshop on Approximation and Online Algorithms
…Partial Multicuts in Trees ⋆ Asaf Levin 1 and Danny Segev 2 1 Department of Statistics, The Hebrew…
Cited by 6 (3 self) – Add To MetaCart

Path hitting in acyclic graphs
by Ojas Parekh, Danny Segev — 2006 — In Proceedings of the 14th Annual European Symposium on Algorithms
…Path Hitting in Acyclic Graphs ⋆ Ojas Parekh 1 and Danny Segev 2 1 Department of Mathematics…
Cited by 3 (1 self) – Add To MetaCart

Improved online algorithms for the sorting buffer problem
by Iftah Gamzu, Danny Segev — 2007 — In Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS
…Improved Online Algorithms for the Sorting Buffer Problem ⋆ Iftah Gamzu 1⋆⋆ and Danny Segev 2 1…
Cited by 3 (1 self) – Add To MetaCart

Approximation algorithms and hardness results for labeled connectivity problems
by Refael Hassin, Jérôme Monnot, Danny Segev — 2006 — In 31st MFCS
… , Jérôme Monnot 2 , and Danny Segev 1 1 School of Mathematical Sciences, Tel-Aviv University, Israel…
Cited by 2 (1 self) – Add To MetaCart

Set Connectivity Problems in Undirected Graphs and the Directed Steiner Network Problem
by Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
… Chandra Chekuri ∗ Guy Even † Anupam Gupta ‡ Danny Segev § In the generalized connectivity problem, we…
Cited by 3 (1 self) – Add To MetaCart

A unified approach to approximating partial covering problems
by Jochen Könemann, Ojas Parekh, Danny Segev — 2006 — In Proceedings of the 14th Annual European Symposium on Algorithms
… , and Danny Segev 3 1 Department of Combinatorics and Optimization, University of Waterloo, Canada. jochen…
Cited by 4 (1 self) – Add To MetaCart

Showing 1 through 10.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB