Dror Rawitz
YOU?
Author Swipe
View article: Degree Realization by Bipartite Cactus Graphs
Degree Realization by Bipartite Cactus Graphs Open
The \textsc{Degree Realization} problem with respect to a graph family $\mathcal{F}$ is defined as follows. The input is a sequence $d$ of $n$ positive integers, and the goal is to decide whether there exists a graph $G \in \mathcal{F}$ wh…
View article: Degree Realization by Bipartite Multigraphs
Degree Realization by Bipartite Multigraphs Open
The problem of realizing a given degree sequence by a multigraph can be thought of as a relaxation of the classical degree realization problem (where the realizing graph is simple). This paper concerns the case where the realizing multigra…
View article: Online Multiset Submodular Cover
Online Multiset Submodular Cover Open
We study the Online Multiset Submodular Cover problem ( OMSC ), where we are given a universe U of elements and a collection of subsets $$\mathcal {S}\subseteq 2^U$$ . Each element $$u_j \in U$$ is associated with a nonnegati…
View article: Approximate Realizations for Outerplanaric Degree Sequences
Approximate Realizations for Outerplanaric Degree Sequences Open
We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerpl…
View article: Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods Open
The classical problem of degree sequence realizability asks whether or not a given sequence of $n$ positive integers is equal to the degree sequence of some $n$-vertex undirected simple graph. While the realizability problem of degree sequ…
View article: Efficiently Realizing Interval Sequences
Efficiently Realizing Interval Sequences Open
We consider the problem of realizable interval-sequences. An interval sequence comprises of n integer intervals [a_i,b_i] such that 0 <= a_i <= b_i <= n-1, and is said to be graphic/realizable if there exists a graph with degree sequence, …
View article: The Generalized Microscopic Image Reconstruction Problem
The Generalized Microscopic Image Reconstruction Problem Open
This paper presents and studies a generalization of the microscopic image reconstruction problem (MIR) introduced by Frosini and Nivat [Andrea Frosini and Maurice Nivat, 2007; Nivat, 2002]. Consider a specimen for inspection, represented a…
View article: Local Search Algorithms for Maximum Carpool Matching
Local Search Algorithms for Maximum Carpool Matching Open
The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph G = (V, A), a capacity function c: V -> N, and a weight function w: A -> R^+, a carpool matching is a subset of arcs, M sub…
View article: Distributed Approximation of k-Service Assignment
Distributed Approximation of k-Service Assignment Open
We consider the k-Service Assignment problem (k-SA), defined as follows. The input consists of a network that contains servers and clients, and an integer k. Each server has a finite capacity, and each client is associated with a demand an…
View article: Online Budgeted Maximum Coverage
Online Budgeted Maximum Coverage Open
We study the Online Budgeted Maximum Coverage (OBMC) problem. Subsets of a weighted ground set U arrive one by one, where each set has a cost. The online algorithm has to select a collection of sets, under the constraint that their cost is…