SODA A*

137 papers

YearTitle / Authors
2014(Nearly) Sample-Optimal Sparse Fourier Transform.
Piotr Indyk, Michael Kapralov, Eric Price
2014A Constant Factor Approximation Algorithm for Fault-Tolerant
MohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha
2014A Cubic Algorithm for Computing Gaussian Volume.
Ben Cousins, Santosh S. Vempala
2014A Mazing 2+
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2014A Near-Optimal Planarization Algorithm.
Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh
2014A New Perspective on Vertex Connectivity.
Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn
2014A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage.
Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio
2014A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices.
Anna Adamaszek, Andreas Wiese
2014A Simple FPTAS for Counting Edge Covers.
Chengyu Lin, Jingcheng Liu, Pinyan Lu
2014A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension.
Esther Ezra
2014A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.
Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
2014A constructive algorithm for the Lovász Local Lemma on permutations.
David G. Harris, Aravind Srinivasan
2014A subexponential parameterized algorithm for Subset TSP on planar graphs.
Philip N. Klein, Dániel Marx
2014An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations.
Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, Aaron Sidford
2014An Excluded Grid Theorem for Digraphs with Forbidden Minors.
Ken-ichi Kawarabayashi, Stephan Kreutzer
2014An Optimal Lower Bound for Distinct Elements in the Message Passing Model.
David P. Woodruff, Qin Zhang
2014Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems.
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
2014Annotations for Sparse Data Streams.
Amit Chakrabarti, Graham Cormode, Navin Goyal, Justin Thaler
2014Approximating
David Eisenstat, Philip N. Klein, Claire Mathieu
2014Approximating Local Homology from Samples.
Primoz Skraba, Bei Wang
2014Approximating Minimum Cost Connectivity Orientation and Augmentation.
Mohit Singh, László A. Végh
2014Approximating matching size from random streams.
Michael Kapralov, Sanjeev Khanna, Madhu Sudan
2014Approximation Algorithm for Sparsest
Anand Louis, Konstantin Makarychev
2014Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover.
Amol Deshpande, Lisa Hellerstein, Devorah Kletenik
2014Approximation-Tolerant Model-Based Compressive Sensing.
Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2014Arboricity and spanning-tree packing in random graphs with an application to load balancing.
Pu Gao, Xavier Pérez-Giménez, Cristiane M. Sato
2014Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach.
Nikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li
2014Better Approximation Algorithms for the Graph Diameter.
Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams
2014Better Approximation Bounds for the Joint Replenishment Problem.
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall
2014Beyond Locality-Sensitive Hashing.
Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn
2014Bicriteria data compression.
Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini
2014Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut.
Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan
2014Broadcast Throughput in Radio Networks: Routing vs. Network Coding.
Noga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian
2014Cache-Adaptive Algorithms.
Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley
2014Causal Erasure Channels.
Raef Bassily, Adam D. Smith
2014Clustering and Mixing Times for Segregation Models on ℤ
Prateek Bhakta, Sarah Miracle, Dana Randall
2014Competitive Analysis via Regularization.
Niv Buchbinder, Shahar Chen, Joseph Naor
2014Computing Cut-Based Hierarchical Decompositions in Almost Linear Time.
Harald Räcke, Chintan Shah, Hanjo Täubig
2014Concurrent Range Reporting in Two-Dimensional Space.
Peyman Afshani, Cheng Sheng, Yufei Tao, Bryan T. Wilkinson
2014Constrained Signaling in Auction Design.
Shaddin Dughmi, Nicole Immorlica, Aaron Roth
2014Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time.
Andreas Björklund, Petteri Kaski, Lukasz Kowalik
2014Cutting corners cheaply, or how to remove Steiner points.
Lior Kamma, Robert Krauthgamer, Huy L. Nguyen
2014Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles.
Thomas Dueholm Hansen, Haim Kaplan, Uri Zwick
2014Disjoint Set Union with Randomized Linking.
Ashish Goel, Sanjeev Khanna, Daniel H. Larkin, Robert Endre Tarjan
2014Dynamic Task Allocation in Asynchronous Shared Memory.
Dan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert
2014Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms.
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
2014Efficient quantum protocols for XOR functions.
Shengyu Zhang
2014Exploiting Metric Structure for Efficient Private Query Release.
Zhiyi Huang, Aaron Roth
2014Fast Computation of Output-Sensitive Maxima in a Word RAM.
Peyman Afshani
2014Fast algorithms for maximizing submodular functions.
Ashwinkumar Badanidiyuru, Jan Vondrák
2014Faster Agreement via a Spectral Method for Detecting Malicious Behavior.
Valerie King, Jared Saia
2014Fault Tolerant Approximate BFS Structures.
Merav Parter, David Peleg
2014Finding orthogonal vectors in discrete structures.
Ryan Williams, Huacheng Yu
2014Finding small patterns in permutations in linear time.
Sylvain Guillemot, Dániel Marx
2014First Come First Served for Online Slot Allocation and Huffman Coding.
Monik Khare, Claire Mathieu, Neal E. Young
2014Flow-Based Algorithms for Local Graph Clustering.
Lorenzo Orecchia, Zeyuan Allen Zhu
2014Four Soviets Walk the Dog - with an Application to Alt's Conjecture.
Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer
2014Half-integrality, LP-branching and FPT Algorithms.
Magnus Wahlström
2014Hallucination Helps: Energy Efficient Virtual Circuit Routing.
Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
2014Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs.
Subhash Khot, Rishi Saket
2014Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random Graphs.
Ryan O'Donnell, John Wright, Chenggang Wu, Yuan Zhou
2014Hereditary properties of permutations are strongly testable.
Tereza Klimosová, Daniel Král'
2014Hypercontractive inequalities via SOS, and the Frankl-Rödl graph.
Manuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou
2014Implicit Manifold Reconstruction.
Siu-Wing Cheng, Man-Kwun Chiu
2014Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs.
Wang Chi Cheung, Michel X. Goemans, Sam Chiu-wai Wong
2014Improved Approximation Algorithm for Two-Dimensional Bin Packing.
Nikhil Bansal, Arindam Khan
2014Improved Concentration Bounds for Count-Sketch.
Gregory T. Minton, Eric Price
2014Improved bounds and algorithms for graph cuts and network reliability.
David G. Harris, Aravind Srinivasan
2014Improved upper bounds for Random-Edge and Random-Jump on abstract cubes.
Thomas Dueholm Hansen, Mike Paterson, Uri Zwick
2014Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract.
Will Ma
2014Independent Set in
Daniel Lokshtanov, Martin Vatshelle, Yngve Villanger
2014Influence Maximization in Undirected Networks.
Sanjeev Khanna, Brendan Lucier
2014Integer quadratic programming in the plane.
Alberto Del Pia, Robert Weismantel
2014Interval Deletion is Fixed-Parameter Tractable.
Yixin Cao, Dániel Marx
2014Intrinsic universality in tile self-assembly requires cooperation.
Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods
2014Large induced subgraphs via triangulations and CMSO.
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
2014Learning Entangled Single-Sample Gaussians.
Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi
2014Learning Sparse Polynomial Functions.
Alexandr Andoni, Rina Panigrahy, Gregory Valiant, Li Zhang
2014Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts.
M. S. Ramanujan, Saket Saurabh
2014Linear-Time FPT Algorithms via Network Flow.
Yoichi Iwata, Keigo Oka, Yuichi Yoshida
2014MCMC sampling colourings and independent sets of
Charilaos Efthymiou
2014Maintaining Assignments Online: Matching, Scheduling, and Flows.
Anupam Gupta, Amit Kumar, Cliff Stein
2014Making Octants Colorful and Related Covering Decomposition Problems.
Jean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt
2014Maximizing Bisubmodular and
Justin Ward, Stanislav Zivný
2014Maximizing Social Influence in Nearly Optimal Time.
Christian Borgs, Michael Brautbar, Jennifer T. Chayes, Brendan Lucier
2014Minimum
Anupam Gupta, Anastasios Sidiropoulos
2014Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable.
Laurent Bulteau, Christian Komusiewicz
2014Model-based Sketching and Recovery with Expanders.
Bubacarr Bah, Luca Baldassarre, Volkan Cevher
2014Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b-Matching Problems in Nonbipartite Graphs.
Kook Jin Ahn, Sudipto Guha
2014Near-optimal labeling schemes for nearest common ancestors.
Stephen Alstrup, Esben Bistrup Halvorsen, Kasper Green Larsen
2014New Approximations for Reordering Buffer Management.
Sungjin Im, Benjamin Moseley
2014New constructions of RIP matrices with fast multiplication and fewer rows.
Jelani Nelson, Eric Price, Mary Wootters
2014Non-Uniform Graph Partitioning.
Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar
2014On Computability of Equilibria in Markets with Production.
Jugal Garg, Vijay V. Vazirani
2014On Sketching Matrix Norms and the Top Singular Vector.
Yi Li, Huy L. Nguyen, David P. Woodruff
2014On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank.
Herbert Edelsbrunner, Salman Parsa
2014On the Lattice Isomorphism Problem.
Ishay Haviv, Oded Regev
2014On the compatibility of quartet trees.
Noga Alon, Sagi Snir, Raphael Yuster
2014On the optimality of approximation schemes for the classical scheduling problem.
Lin Chen, Klaus Jansen, Guochuan Zhang
2014Online Steiner Tree with Deletions.
Anupam Gupta, Amit Kumar
2014Optimal Algorithms for Testing Closeness of Discrete Distributions.
Siu On Chan, Ilias Diakonikolas, Paul Valiant, Gregory Valiant
2014Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges.
Peyman Afshani, Konstantinos Tsakalidis
2014Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets.
Venkatesan Guruswami, Chaoping Xing
2014Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence.
Georgios Piliouras, Jeff S. Shamma
2014Packing
Yutaro Yamaguchi
2014Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems.
Bundit Laekhanukit
2014Partitioning into Expanders.
Shayan Oveis Gharan, Luca Trevisan
2014Pipage Rounding, Pessimistic Estimators and Matrix Concentration.
Nicholas J. A. Harvey, Neil Olver
2014Point Line Cover: The Easy Kernel is Essentially Tight.
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
2014Polynomial Solvability of Variants of the Trust-Region Subproblem.
Daniel Bienstock, Alexander Michalka
2014Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
René Sitters
2014Polynomiality for Bin Packing with a Constant Number of Item Types.
Michel X. Goemans, Thomas Rothvoß
2014Positivity Problems for Low-Order Linear Recurrence Sequences.
Joël Ouaknine, James Worrell
2014Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms.
Nikhil R. Devanur, Zhiyi Huang
2014Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014
Chandra Chekuri
2014Prophet Inequalities with Limited Information.
Pablo Daniel Azar, Robert Kleinberg, S. Matthew Weinberg
2014Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints.
T.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao
2014Relative Errors for Deterministic Low-Rank Matrix Approximations.
Mina Ghashami, Jeff M. Phillips
2014Robust Satisfiability of Systems of Equations.
Peter Franek, Marek Krcál
2014Selection and Sorting in the "Restore" Model.
Timothy M. Chan, J. Ian Munro, Venkatesh Raman
2014Smoothed Analysis of Local Search for the Maximum-Cut Problem.
Michael Etscheid, Heiko Röglin
2014Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball.
Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington
2014Space complexity of list
László Egri, Pavol Hell, Benoît Larose, Arash Rafiey
2014Streaming Balanced Graph Partitioning Algorithms for Random Graphs.
Isabelle Stanton
2014Submodular Maximization with Cardinality Constraints.
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2014Testing Surface Area.
Pravesh Kothari, Amir Nayyeri, Ryan O'Donnell, Chenggang Wu
2014Testing equivalence between distributions using conditional samples.
Clément L. Canonne, Dana Ron, Rocco A. Servedio
2014The Complexity of Optimal Mechanism Design.
Constantinos Daskalakis, Alan Deckelbaum, Christos Tzamos
2014The Complexity of Optimal Multidimensional Pricing.
Xi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis
2014The Complexity of Order Type Isomorphism.
Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer
2014The Generalized Terminal Backup Problem.
Attila Bernáth, Yusuke Kobayashi
2014Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions).
Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx
2014Tight Bounds for Rumor Spreading with Vertex Expansion.
George Giakkoupis
2014Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids.
Martin Dietzfelbinger, Philipp Woelfel
2014Timing in chemical reaction networks.
David Doty
2014Towards (1 +
Alexandr Andoni, Anupam Gupta, Robert Krauthgamer
2014Uniform random sampling of simple branched coverings of the sphere by itself.
Enrica Duchi, Dominique Poulalhon, Gilles Schaeffer