Search Results - f.2 [theory of computation]: analysis of algorithms and (problem OR problems) complexity~

Cut Query Algorithms with Star Contraction by Apers, Simon, Efron, Yuval, Gawrychowski, Pawel, Lee, Troy, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show…”
Get full text

Nearly Optimal Communication and Query Complexity of Bipartite Matching by Blikstad, Joakim, Van Den Brand, Jan, Efron, Yuval, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We settle the complexities of the maximum-cardinality bipartite matching problem (BMM…”
Get full text

CNF Satisfiability in a Subspace and Related Problems by Arvind, V., Guruswami, Venkatesan

“… (the Union-of-Subspace Avoidance (USA) problem), and finding a common zero of a system of polynomials over F 2 each of which is a product of affine forms…”
Get full text

Online Multistage Subset Maximization Problems by Bampis, Evripidis, Escoffier, Bruno, Schewior, Kevin, Teiller, Alexandre

“…) can be expressed as subset maximization problems : One is given a ground set N = { 1 , ⋯ , n } , a collection F ⊆ 2 N of subsets thereof…”
Get full text

Deterministic Dynamic Matching in O(1) Update Time by Bhattacharya, Sayan, Chakrabarty, Deeparnab, Henzinger, Monika

“… (FOCS), 2016) gave a randomized dynamic algorithm for this problem that has an approximation ratio of 2 and an amortized…”
Get full text

On Maximizing Sums of Non-monotone Submodular and Linear Functions by Qi, Benjamin

“…): given query access to a non-negative submodular function f : 2 N → R ≥ 0 and a linear function ℓ : 2 N…”
Get full text

Dividing Splittable Goods Evenly and With Limited Fragmentation by Damaschke, Peter

“… We call F the fragmentation and mainly restrict attention to the cases F = 1 and F = 2 . For F = 1 , the max–min and min–max problems are solvable in linear time…”
Get full text

On Efficient Noncommutative Polynomial Factorization via Higman Linearization by Arvind, V., Joglekar, Pushkar S.

“… = F q is a finite field, we give a randomized algorithm that runs in time polynomial in s , n and log 2 q that computes a factorization of f as a product f = f 1 f 2…”
Get full text

Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees by Bilò, Davide, Gualà, Luciano, Leucci, Stefano, Proietti, Guido

“… ≥ 1 , we study the problem of designing a sparse f -edge-fault-tolerant ( f -EFT) σ…”
Get full text

Posimodular Function Optimization by Halldórsson, Magnús M., Ishii, Toshimasa, Makino, Kazuhisa, Takazawa, Kenjiro

“…A function f : 2 V → R on a finite set V is posimodular if f ( X ) + f ( Y ) ≥ f ( X \ Y ) + f ( Y \ X ) , for all X , Y ⊆ V . Posimodular functions often arise in combinatorial optimization such as undirected cut functions…”
Get full text

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands by Chitnis, Rajesh, Esfandiari, Hossein, Hajiaghayi, MohammadTaghi, Khandekar, Rohit, Kortsarz, Guy, Seddighin, Saeed

“… ≤ i ≠ j ≤ p . The p -SCSS problem is NP-hard, but Feldman and Ruhl [FOCS ’99; SICOMP ’06] gave a novel n O ( p ) time algorithm. In this paper, we investigate…”
Get full text

O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities by Kao, Mong-Jen, Tu, Hai-Lun, Lee, D. T.

“…We consider capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph G…”
Get full text

Quadratically Tight Relations for Randomized Query Complexity by Jain, Rahul, Klauck, Hartmut, Kundu, Srijita, Lee, Troy, Santha, Miklos, Sanyal, Swagato, Vihrovs, Jevgēnijs

“… ). The certificate complexity C ( f ) is such a complexity measure for the zero-error randomized query complexity R 0 ( f ): C ( f ) ≤ R 0 ( f ) ≤ C ( f ) 2…”
Get full text

Solving Linear Equations Parameterized by Hamming Weight by Arvind, V., Köbler, Johannes, Kuhnert, Sebastian, Torán, Jacobo

“…Given a system of linear equations A x = b over the binary field F 2 and an integer…”
Get full text

f-Sensitivity Distance Oracles and Routing Schemes by Chechik, Shiri, Langberg, Michael, Peleg, David, Roditty, Liam

“…An f-sensitivity distance oracle for a weighted undirected graph G ( V , E ) is a data structure capable of answering restricted distance queries between…”
Get full text

Local Expanders by Viola, Emanuele, Wigderson, Avi

“…) more efficient error reduction for randomized algorithms, and (3) more efficient hardness amplification of one-way permutations…”
Get full text

Online Metric Tracking and Smoothing by Chen, Sixia, Russell, Alexander

“… ) with an associated cost function c :ℝ→ℝ. Given a signal f 1 , f 2 ,…∈ X the tracker is responsible for producing a sequence a 1 , a 2…”
Get full text

Testing the Supermodular-Cut Condition by Tanigawa, Shin-Ichi, Yoshida, Yuichi

“…For a function 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 )≥…”
Get full text

Analysis of the impact of the number of edges in connected graphs on the computational complexity of the independent set problem by Malyshev, D. S.

“…Under study is the complexity status of the independent set problem in a class of connected graphs that are defined by functional constraints on the number of edges depending on the number of vertices…”
Get full text

Incremental Medians via Online Bidding by Chrobak, Marek, Kenyon, Claire, Noga, John, Young, Neal E.

“… An incremental algorithm produces a nested sequence of facility sets F 1 ⊆ F 2 ⊆ ⋅⋅⋅ ⊆ F n , where | F k |= k for each  k . Such an algorithm is called c -cost-competitive if the cost of each F k is at most c times the optimum k -median cost…”
Get full text