Search Results - "Feige, Uriel"

Spectral techniques applied to sparse random graphs by Feige, Uriel, Ofek, Eran

“…We analyze the eigenvalue gap for the adjacency matrices of sparse random graphs. Let λ1 ≥ … ≥ λn be the eigenvalues of an n‐vertex graph, and let λ =…”
Get full text

Genomic variability within an organism exposes its cell lineage tree by Frumkin, Dan, Wasserstrom, Adam, Kaplan, Shai, Feige, Uriel, Shapiro, Ehud

“…What is the lineage relation among the cells of an organism? The answer is sought by developmental biology, immunology, stem cell research, brain research, and…”
Get full text

Approximating the Bandwidth via Volume Respecting Embeddings by Feige, Uriel

“…A linear arrangement of an n-vertex graph is a one-to-one mapping of its vertices to the integers {1, …, n}. The bandwidth of a linear arrangement is the…”
Get full text

An improved approximation ratio for the minimum linear arrangement problem by Feige, Uriel, Lee, James R.

“…We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O ( log n log log n )…”
Get full text

Heuristic for Maximizing DNA Reuse in Synthetic DNA Library Assembly by Blakes, Jonathan, Raz, Ofir, Feige, Uriel, Bacardit, Jaume, Widera, Paweł, Ben-Yehezkel, Tuval, Shapiro, Ehud, Krasnogor, Natalio

“…De novo DNA synthesis is in need of new ideas for increasing production rate and reducing cost. DNA reuse in combinatorial library construction is one such…”
Get full text

Buffer Management for Colored Packets with Deadlines by Azar, Yossi, Feige, Uriel, Gamzu, Iftah, Moscibroda, Thomas, Raghavendra, Prasad

“…We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of…”
Get full text

How to Hide a Clique? by Feige, Uriel, Grinberg, Vadim

“…In the well known planted clique problem, a clique (or alternatively, an independent set) of size k is planted at random in an Erdos-Renyi random G ( n ,  p )…”
Get full text

On the path partition number of 6‐regular graphs by Feige, Uriel, Fuchs, Ella

“…A path partition (also referred to as a linear forest) of a graph G $G$ is a set of vertex‐disjoint paths which together contain all the vertices of G $G$. An…”
Get full text

Target set selection for conservative populations by Feige, Uriel, Kogan, Shimon

“…Let G=(V,E) be a graph on n vertices, where d(v) denotes the degree of vertex v, and t(v) is a threshold associated with v. We consider a process in which…”
Get full text

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning by Feige, Uriel, Langberg, Michael

“…Given a graph G=(V,E), a weight function w: E→R+, and a parameter k, we consider the problem of finding a subset U⊆V of size k that maximizes: Max-Vertex…”
Get full text

The Ordered Covering Problem by Feige, Uriel, Hitron, Yael

“…We study the Ordered Covering (OC) problem. The input is a finite set of n elements X , a color function c : X → { 0 , 1 } and a collection S of subsets of X …”
Get full text

CONTAGIOUS SETS IN RANDOM GRAPHS by Feige, Uriel, Krivelevich, Michael, Reichman, Daniel

“…We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at…”
Get full text

Shotgun assembly of random jigsaw puzzles by Bordenave, Charles, Feige, Uriel, Mossel, Elchanan

“…We consider the shotgun assembly problem for a random jigsaw puzzle, introduced by Mossel and Ross (2015). Their model consists of a puzzle—an n×n grid, where…”
Get full text

Oblivious Algorithms for the Maximum Directed Cut Problem by Feige, Uriel, Jozeph, Shlomo

“…This paper introduces a special family of randomized algorithms for Max DICUT that we call oblivious algorithms. Let the bias of a vertex be the ratio between…”
Get full text

Optimization with Uniform Size Queries by Feige, Uriel, Tennenholtz, Moshe

“…Consider the problem of selecting k items that maximize the value of a monotone submodular set function f , where f can be accessed using value queries. It is…”
Get full text

Recoverable values for independent sets by Feige, Uriel, Reichman, Daniel

“…The notion of recoverable value was advocated in the work of Feige, Immorlica, Mirrokni and Nazerzadeh (APPROX 2009) as a measure of quality for approximation…”
Get full text

On fair division of a homogeneous good by Feige, Uriel, Tennenholtz, Moshe

“…We consider the problem of dividing a homogeneous divisible good among n players. Each player holds a private non-negative utility function that depends only…”
Get full text

Low communication protocols for fair allocation of indivisible goods by Feige, Uriel

“…We study the multi-party randomized communication complexity of computing a fair allocation of $m$ indivisible goods to $n < m$ equally entitled agents. We…”
Get full text

Short tandem repeat stutter model inferred from direct measurement of in vitro stutter noise by Raz, Ofir, Biezuner, Tamir, Spiro, Adam, Amir, Shiran, Milo, Lilach, Titelman, Alon, Onn, Amos, Chapal-Ilani, Noa, Tao, Liming, Marx, Tzipy, Feige, Uriel, Shapiro, Ehud

“…Abstract Short tandem repeats (STRs) are polymorphic genomic loci valuable for various applications such as research, diagnostics and forensics. However, their…”
Get full text

The inversion paradox, and classification of fairness notions by Feige, Uriel

“…Several different fairness notions have been introduced in the context of fair allocation of goods. In this manuscript, we compare between some fairness…”
Get full text