Výsledky vyhľadávania - F.2 Analysis of Algorithms and Problem Complexity

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

“…We settle the complexities of the maximum-cardinality bipartite matching problem (BMM…”
Získať plný text

Cut Query Algorithms with Star Contraction Autor 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…”
Získať plný text

Efficient assembly consensus algorithms for divergent contig sets Autor Chateau, Annie, Davot, Tom, Lafond, Manuel

“… This amounts to orienting and ordering sets of contigs, which can be viewed as an optimization problem where the aim is to find an alignment of two fragmented strings that maximizes an arbitrary…”
Získať plný text

Dividing Splittable Goods Evenly and With Limited Fragmentation Autor 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…”
Získať plný text

Deterministic Dynamic Matching in O(1) Update Time Autor 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…”
Získať plný text

Algorithms and Lower Bounds for Replacement Paths under Multiple Edge Failure Autor Williams, Virginia Vassilevska, Woldeghebriel, Eyob, Xu, Yinzhan

“… We call this problem f-Fault Replacement Paths (f FRP).We first present an \tilde{O}(n^{3}) time algorithm for 2FRP in n-vertex directed graphs with arbitrary edge weights and no negative cycles…”
Získať plný text

Online Multistage Subset Maximization Problems Autor 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…”
Získať plný text

CNF Satisfiability in a Subspace and Related Problems Autor 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…”
Získať plný text

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

“…): given query access to a non-negative submodular function f : 2 N → R ≥ 0 and a linear function ℓ : 2 N…”
Získať plný text

Combinatorial Iterative Algorithms for Computing the Centroid of an Interval Type-2 Fuzzy Set Autor Liu, Xianliang, Wan, Shuping

“…, if there are two optimal solutions f 1 (x) and f 2 (x), the Lebesgue measure of {x|f 1 (x) ≠ f 2 (x)} is equal to 0. Subsequently, a combinatorial iterative…”
Získať plný text

On Efficient Noncommutative Polynomial Factorization via Higman Linearization Autor 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…”
Získať plný text

Posimodular Function Optimization Autor 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…”
Získať plný text

Quadratically Tight Relations for Randomized Query Complexity Autor 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…”
Získať plný text

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

“… ≥ 1 , we study the problem of designing a sparse f -edge-fault-tolerant ( f -EFT) σ…”
Získať plný text

Approximation algorithms for solving the line-capacitated minimum Steiner tree problem Autor Li, Jianping, Wang, Wencheng, Lichen, Junran, Liu, Suding, Pan, Pengxiang

“…In this paper, we address the line-capacitated minimum Steiner tree problem (the Lc-MStT problem, for short…”
Získať plný text

On Hitting-Set Generators for Polynomials that Vanish Rarely Autor Doron, Dean, Ta-Shma, Amnon, Tell, Roei

“…The problem of constructing pseudorandom generators for polynomials of low degree is fundamental in complexity theory and has numerous well-known applications…”
Získať plný text

Resolution with Counting: Dag-Like Lower Bounds and Different Moduli Autor Part, Fedor, Tzameret, Iddo

“…Resolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting…”
Získať plný text

A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands Autor 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…”
Získať plný text

The NOF Multiparty Communication Complexity of Composed Functions Autor Ada, Anil, Chattopadhyay, Arkadev, Fawzi, Omar, Nguyen, Phuong

“…We study the k -party “number on the forehead” communication complexity of composed functions f ∘ g → , where f : { 0 , 1 } n → { ± 1 } , g → = ( g 1 , … , g n…”
Získať plný text

A new algorithm for optimal 2-constraint satisfaction and its implications Autor Williams, Ryan

“… MAX-2-CSP and MIN-2-CSP), which gives the first exponential improvement over the trivial algorithm…”
Získať plný text