1

December 2017
ACM Transactions on Computation Theory (TOCT): Volume 9 Issue 4, January 2018

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 0

Downloads (6 Weeks): 18, Downloads (12 Months): 18, Downloads (Overall): 18

Full text available:

PDF
This article studies property testing for NP optimization problems with parameter k under the general graph model with an augmentation of random edge sampling capability. It is shown that a variety of such problems, including k -Vertex Cover, k -Feedback Vertex Set, k -Multicut, k -Path-Free, and k -Dominating Set, ...

**Keywords**:
Property testing, fixed parameter tractability

2

May 2017
SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 1

Downloads (6 Weeks): 47, Downloads (12 Months): 407, Downloads (Overall): 407

Full text available:

PDF
Consider a directed edge-labeled graph, such as a social network or a citation network. A fundamental query on such data is to determine if there is a path in the graph from a given source vertex to a given target vertex, using only edges with labels in a restricted subset ...

**Keywords**:
labeled graph, label-constrained reachability, path queries

3

December 2016
Computational Complexity: Volume 25 Issue 4, December 2016

**Publisher:** Birkhauser Verlag

In the List H- Homomorphism Problem, for a graph H that is a parameter of the problem, an instance consists of an undirected graph G with a list constraint $${L(v) \subseteq V(H)}$$L(v)⊆V(H) for each variable $${v \in V(G)}$$vźV(G), and the objective is to determine whether there is a list H-homomorphism ...

**Keywords**:
constraint satisfaction problems, list H-homomorphism, Property testing, universal algebra, 68Q17

4

August 2016
Proceedings of the VLDB Endowment: Volume 9 Issue 12, August 2016

**Publisher:** VLDB Endowment

**Bibliometrics**:

Citation Count: 4

Downloads (6 Weeks): 5, Downloads (12 Months): 79, Downloads (Overall): 115

Full text available:

PDF
We propose the first real-time fully-dynamic index data structure designed for influence analysis on evolving networks. With this aim, we carefully redesign the data structure of the state-of-the-art sketching method introduced by Borgs et al. , and construct corresponding update algorithms. Using this index, we present algorithms for two kinds ...

5

July 2016
IJCAI'16: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence

**Publisher:** AAAI Press

In a connected graph, spanning tree centralities of a vertex and an edge measure how crucial they are for the graph to be connected. In this paper, we propose efficient algorithms for estimating spanning tree centralities with theoretical guarantees on their accuracy. We experimentally demonstrate that our methods are orders ...

6

June 2016
IPCO 2016: Proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization - Volume 9682

**Publisher:** Springer-Verlag New York, Inc.

The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the integer lattice. Suppose that a non-negative monotone submodular function $$f:\mathbb {Z}_+^n \rightarrow \mathbb {R}_+$$ is given via an ...

7

February 2016
WSDM '16: Proceedings of the Ninth ACM International Conference on Web Search and Data Mining

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 0

Downloads (6 Weeks): 4, Downloads (12 Months): 75, Downloads (Overall): 341

Full text available:

PDF
In this work, we introduce a new Markov operator associated with a digraph, which we refer to as a nonlinear Laplacian. Unlike previous Laplacians for digraphs, the nonlinear Laplacian does not rely on the stationary distribution of the random walk process and is well defined on digraphs that are not ...

**Keywords**:
spectral graph theory

8

January 2016
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms

**Publisher:** Society for Industrial and Applied Mathematics

**Bibliometrics**:

Citation Count: 2

Downloads (6 Weeks): 10, Downloads (12 Months): 57, Downloads (Overall): 100

Full text available:

PDF
This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k -submodular functions. This improves upon the previous max{1/3, 1/(1 + a )}-approximation by Ward and Živný [18], where a = max{1, [EQUATION]}. We also show that for monotone k -submodular functions there is a polynomial-time k /(2 k --1)-approximation ...

9

January 2016
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms

**Publisher:** Society for Industrial and Applied Mathematics

**Bibliometrics**:

Citation Count: 0

Downloads (6 Weeks): 1, Downloads (12 Months): 14, Downloads (Overall): 95

Full text available:

PDF
We consider stable signal recovery in ℓ q quasi-norm for 0 < q ≤ 1. In this problem, given a measurement vector y = A x for some unknown signal vector x ∈ R n and a known matrix A ∈ R m × n , we want to recover ...

10

January 2016
SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms

**Publisher:** Society for Industrial and Applied Mathematics

**Bibliometrics**:

Citation Count: 1

Downloads (6 Weeks): 3, Downloads (12 Months): 14, Downloads (Overall): 39

Full text available:

PDF
Let { f i : F i p → {0, 1}} be a sequence of functions, where p is a fixed prime and F p is the finite field of order p. The limit of the sequence can be syntactically defined using the notion of ultralimit. Inspired by the Gowers ...

11

December 2015
NIPS'15: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1

**Publisher:** MIT Press

We consider a generalization of the submodular cover problem based on the concept of diminishing return property on the integer lattice. We are motivated by real scenarios in machine learning that cannot be captured by (traditional) sub-modular set functions. We show that the generalized submodular cover problem can be applied ...

12

December 2015
NIPS'15: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1

**Publisher:** MIT Press

A k -submodular function is a generalization of a submodular function, where the input consists of k disjoint subsets, instead of a single subset, of the domain. Many machine learning problems, including influence maximization with k kinds of topics and sensor placement with k kinds of sensors, can be naturally ...

13

October 2015
Proceedings of the VLDB Endowment: Volume 9 Issue 2, October 2015

**Publisher:** VLDB Endowment

**Bibliometrics**:

Citation Count: 2

Downloads (6 Weeks): 3, Downloads (12 Months): 33, Downloads (Overall): 100

Full text available:

PDF
Measuring the relative importance of each vertex in a network is one of the most fundamental building blocks in network analysis. Among several importance measures, betweenness centrality , in particular, plays key roles in many real applications. Considerable effort has been made for developing algorithms for static settings. However, real ...

14

September 2015
Random Structures & Algorithms: Volume 47 Issue 2, September 2015

**Publisher:** John Wiley & Sons, Inc.

Long Code testing is a fundamental problem in the area of property testing and hardness of approximation. In this paper, we study how small the soundness s of the Long Code test with perfect completeness can be by using non-adaptive q queries. We show that s = 2q + 3/2q ...

**Keywords**:
long code test, amortized query complexity, influence of variables, dictatorship test

15

September 2015
Algorithmica: Volume 73 Issue 1, September 2015

**Publisher:** Springer-Verlag New York, Inc.

We present an efficient algorithm for testing outerplanarity of graphs in the bounded-degree model. In this model, given a graph $$G$$G with degree bound $$d$$d, we should distinguish with high probability the case that $$G$$G is outerplanar from the case that modifying at least an $$\epsilon $$∈-fraction of the edge ...

**Keywords**:
Bounded-degree model, Property testing, Outerplanarity

16

April 2015
Algorithmica: Volume 71 Issue 4, April 2015

**Publisher:** Springer-Verlag New York, Inc.

For a function $f:2^{V} \to \mathbb {Z}_{+}$ on a finite set V with f (�)= f ( V )=0, a digraph D =( V , A ) is called f -connected if it satisfies the f -cut condition, that is, � D ( X )� f ( X ) for ...

**Keywords**:
Bounded-degree model, Property testing, Supermodularity

17

February 2015
Theory of Computing Systems: Volume 56 Issue 2, February 2015

**Publisher:** Springer-Verlag New York, Inc.

Three men, each with a sister, must cross a river using a boat that can carry only two people in such a way that a sister is never left in the company of another man if her brother is not present. This very famous problem appeared in the Latin book ...

**Keywords**:
NP-hard, Edgeexpansion, Graphs, Polynomial-time algorithms, River crossing problems, hypercube, Reachability

18

January 2015
AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence

**Publisher:** AAAI Press

We propose an indexing scheme for top- k shortest-path distance queries on graphs, which is useful in a wide range of important applications such as network-aware searches and link prediction. While many efficient methods for answering standard (top-1) distance queries have been developed, none of these methods are directly extensible ...

19

January 2015
AAAI'15: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence

**Publisher:** AAAI Press

We introduce a new framework for solving distributed constraint optimization problems that extend the domain of each variable into a simplex. We propose two methods for searching the extended domain for good assignments. The first one relaxes the problem using linear programming, finds the optimum LP solution, and rounds it ...

20

December 2014
Random Structures & Algorithms: Volume 45 Issue 4, December 2014

**Publisher:** John Wiley & Sons, Inc.

Long Code testing is a fundamental problem in the area of property testing and hardness of approximation. In this paper, we study how small the soundness s of the Long Code test with perfect completeness can be by using non-adaptive q queries. We show that s = 2q + 3/2q ...

**Keywords**:
dictatorship test, long code test, amortized query complexity, influence of variables