Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration
Abstract
References
Recommendations
New algorithms for maximum disjoint paths based on tree-likeness
We study the classical $${\mathsf {NP}}$$NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph. The approximability of ...
Computational Aspects of the Colorful Carathéodory Theorem
Let $$C_1,\dots ,C_{d+1}\subset \mathbb {R}^d$$C1,ý,Cd+1ýRd be $$d+1$$d+1 point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $$p_1, \dots , p_{d+1}$$p1,ý,pd+1 with $$p_i \in C_i$$piýCi, ...
Approximately Counting Triangles in Sublinear Time
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a sublinear-time algorithm for ...
Comments
Information & Contributors
Information
Published In
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Author Tags
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in