SODA A*

136 papers

YearTitle / Authors
20101-Pass Relative-Error L
Morteza Monemizadeh, David P. Woodruff
2010A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model.
Bahman Bahmani, Aranyak Mehta, Rajeev Motwani
2010A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover.
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy
2010A Deterministic Truthful PTAS for Scheduling Related Machines.
George Christodoulou, Annamária Kovács
2010A Fourier Space Algorithm for Solving Quadratic Assignment Problems.
Risi Kondor
2010A Locality-Sensitive Hash for Real Vectors.
Tyler Neylon
2010A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks.
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
2010A Model of Computation for MapReduce.
Howard J. Karloff, Siddharth Suri, Sergei Vassilvitskii
2010A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs.
Aaron Bernstein
2010A Polynomial Time Approximation Scheme for k-Consensus Clustering.
Tom Coleman, Anthony Wirth
2010A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics.
T.-H. Hubert Chan, Khaled M. Elbassioni
2010A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing.
Aparna Das, Claire Mathieu
2010A Space-Time Tradeoff for Permutation Problems.
Mikko Koivisto, Pekka Parviainen
2010Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh
2010Algorithms and Complexity for Periodic Real-Time Scheduling.
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow
2010Algorithms for Ray Class Groups and Hilbert Class Fields.
Kirsten Eisenträger, Sean Hallgren
2010An (almost) Linear Time Algorithm for Odd Cyles Transversal.
Ken-ichi Kawarabayashi, Bruce A. Reed
2010An Improved Competitive Algorithm for Reordering Buffer Management.
Noa Avigdor-Elgrabli, Yuval Rabani
2010An Improved Construction of Progression-Free Sets.
Michael Elkin
2010An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem.
Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi
2010An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling.
Sungjin Im, Benjamin Moseley
2010Applications of Forbidden 0-1 Matrices to Search Tree and Path Compression-Based Data Structures.
Seth Pettie
2010Approximability of Robust Network Design.
Neil Olver, F. Bruce Shepherd
2010Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface.
Petr Hlinený, Markus Chimani
2010Asymmetric Traveling Salesman Path and Directed Latency Problems.
Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina
2010Basis Reduction and the Complexity of Brand-and-Bound.
Gábor Pataki, Mustafa Kemal Tural, Erick B. Wong
2010Belief Propagation for Min-cost Network Flow: Convergence & Correctness.
David Gamarnik, Devavrat Shah, Yehua Wei
2010Bidimensionality and Kernels.
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
2010Bounding Variance and Expectation of Longest Path Lengths in DAGs.
Jeff Edmonds, Supratik Chakraborty
2010Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.
Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro
2010Cell-Probe Lower Bounds for Succinct Partial Sums.
Mihai Patrascu, Emanuele Viola
2010Classified Stable Matching.
Chien-Chung Huang
2010Compact Ancestry Labeling Schemes for XML Trees.
Pierre Fraigniaud, Amos Korman
2010Convergence, Stability, and Discrete Approximation of Laplace Spectra.
Tamal K. Dey, Pawas Ranjan, Yusu Wang
2010Coresets and Sketches for High Dimensional Subspace Approximation Problems.
Dan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff
2010Correlation Clustering with Noisy Input.
Claire Mathieu, Warren Schudy
2010Correlation Robust Stochastic Optimization.
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Ye
2010Counting Inversions, Offline Orthogonal Range Counting, and Related Problems.
Timothy M. Chan, Mihai Patrascu
2010Counting Stars and Other Small Subgraphs in Sublinear Time.
Mira Gonen, Dana Ron, Yuval Shavitt
2010Data Structures for Range Minimum Queries in Multidimensional Arrays.
Hao Yuan, Mikhail J. Atallah
2010Data-Specific Analysis of String Sorting.
Raimund Seidel
2010Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs.
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi
2010Deletion Without Rebalancing in Balanced Binary Trees.
Siddhartha Sen, Robert Endre Tarjan
2010Deterministic Algorithms for the Lovász Local Lemma.
Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler
2010Differential Privacy in New Settings.
Cynthia Dwork
2010Differentially Private Combinatorial Optimization.
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar
2010Distributed Agreement with Optimal Communication Complexity.
Seth Gilbert, Dariusz R. Kowalski
2010EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard.
Friedrich Eisenbrand, Thomas Rothvoß
2010Efficient Broadcast on Random Geometric Graphs.
Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
2010Efficiently Decodable Non-adaptive Group Testing.
Piotr Indyk, Hung Q. Ngo, Atri Rudra
2010Energy Efficient Scheduling via Partial Shutdown.
Samir Khuller, Jian Li, Barna Saha
2010Fast Distance Multiplication of Unit-Monge Matrices.
Alexander Tiskin
2010Fast SDP Algorithms for Constraint Satisfaction Problems.
David Steurer
2010Faster Exponential Time Algorithms for the Shortest Vector Problem.
Daniele Micciancio, Panagiotis Voulgaris
2010Finding the Jaccard Median.
Flavio Chierichetti, Ravi Kumar, Sandeep Pandey, Sergei Vassilvitskii
2010Flow-Cut Gaps for Integer and Fractional Multiflows.
Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2010Fully-Functional Succinct Trees.
Kunihiko Sadakane, Gonzalo Navarro
2010Generating a d-dimensional Linear Subspace Efficiently.
Raphael Yuster
2010Genus and the Geometry of the Cut Graph.
James R. Lee, Anastasios Sidiropoulos
2010Geometric Optimization and Sums of Algebraic Functions.
Antoine Vigneron
2010Google's Auction for TV Ads.
Noam Nisan
2010Hardness Results for Homology Localization.
Chao Chen, Daniel Freedman
2010Highway Dimension, Shortest Paths, and Provably Efficient Algorithms.
Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck
2010How Far Can You Reach?
Ciprian Borcea, Ileana Streinu
2010How Good is the Chord Algorithm?.
Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis
2010How to Meet Asynchronously (Almost) Everywhere.
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
2010Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls.
Aaron Archer, Anna Blasiak
2010Inapproximability for Planar Embedding Problems.
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias
2010Inapproximability for VCG-Based Combinatorial Auctions.
David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans
2010Incentive Compatible Budget Elicitation in Multi-unit Auctions.
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, Lirong Xia
2010Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities.
Alexandr Andoni, T. S. Jayram, Mihai Patrascu
2010Lower Bounds for Sparse Recovery.
Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff
2010Lower Bounds for Testing Triangle-freeness in Boolean Functions.
Arnab Bhattacharyya, Ning Xie
2010Maximum Flows and Parametric Shortest Paths in Planar Graphs.
Jeff Erickson
2010Monotonicity in Bargaining Networks.
Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani
2010Near-Optimal Sublinear Time Algorithms for Ulam Distance.
Alexandr Andoni, Huy L. Nguyen
2010On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic.
Stephan Kreutzer, Siamak Tazari
2010On Linear and Semidefinite Programming Relaxations for Hypergraph Matching.
Yuk Hei Chan, Lap Chi Lau
2010On Nonlinear Forbidden 0-1 Matrices: A Refutation of a Füredi-Hajnal Conjecture.
Seth Pettie
2010On the Cell Probe Complexity of Dynamic Membership.
Ke Yi, Qin Zhang
2010On the Equilibria of Alternating Move Games.
Aaron Roth, Maria-Florina Balcan, Adam Kalai, Yishay Mansour
2010On the Exact Space Complexity of Sketching and Streaming Small Norms.
Daniel M. Kane, Jelani Nelson, David P. Woodruff
2010On the Optimality of Spiral Search.
Elmar Langetepe
2010On the Possibility of Faster SAT Algorithms.
Mihai Patrascu, Ryan Williams
2010One-Counter Markov Decision Processes.
Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak
2010Online Learning with Queries.
Chao-Kai Chiang, Chi-Jen Lu
2010Optimally Reconstructing Weighted Graphs Using Queries.
Hanna Mazzawi
2010Orthogonal Ham-Sandwich Theorem in R
Sergey Bereg
2010PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree Graphs.
David Gamarnik, David A. Goldberg, Theophane Weber
2010Paired Approximation Problems and Incompatible Inapproximabilities.
David Eppstein
2010Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph.
Attila Bernáth, Roland Grappe, Zoltán Szigeti
2010Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees.
Prasad Tetali, Juan Carlos Vera, Eric Vigoda, Linji Yang
2010Price of Anarchy for Greedy Auctions.
Brendan Lucier, Allan Borodin
2010Pricing Randomized Allocations.
Patrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg
2010Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications.
Anthony Man-Cho So
2010Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010
Moses Charikar
2010Property Testing and Parameter Testing for Permutations.
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio
2010Quantum Algorithms for Highly Non-Linear Boolean Functions.
Martin Rötteler
2010Quasirandom Load Balancing.
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
2010Randomized Shellsort: A Simple Oblivious Sorting Algorithm.
Michael T. Goodrich
2010Recognizing a Totally Odd K
Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed
2010Reconstructing Approximate Phylogenetic Trees from Quartet Samples.
Sagi Snir, Raphael Yuster
2010Region Growing for Multi-Route Cuts.
Siddharth Barman, Shuchi Chawla
2010Regular Expression Matching with Multi-Strings and Intervals.
Philip Bille, Mikkel Thorup
2010Resource Minimization for Fire Containment.
Parinya Chalermsook, Julia Chuzhoy
2010Road Network Reconstruction for Organizing Paths.
Daniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun
2010Rumour Spreading and Graph Conductance.
Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi
2010SRPT is 1.86-Competitive for Completion Time Scheduling.
Christine Chung, Tim Nonner, Alexander Souza
2010Self-improving Algorithms for Convex Hulls.
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
2010Shape Replication through Self-Assembly and RNase Enzymes.
Zachary Abel, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Scott Duke Kominers, Robert Schweller
2010Sharp Dichotomies for Regret Minimization in Metric Spaces.
Robert Kleinberg, Aleksandrs Slivkins
2010Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities.
Subhash Khot, Assaf Naor
2010Solving MAX-r-SAT Above a Tight Lower Bound.
Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2010Solving Simple Stochastic Tail Games.
Hugo Gimbert, Florian Horn
2010Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time.
Christian Wulff-Nilsen
2010Speeding Up Random Walks with Neighborhood Exploration.
Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald
2010Streaming Algorithms for Extent Problems in High Dimensions.
Pankaj K. Agarwal, R. Sharathkumar
2010Synchrony and Asynchrony in Neural Networks.
Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger
2010Terrain Guarding is NP-Hard.
James King, Erik Krohn
2010Testing Additive Integrality Gaps.
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin
2010Testing Monotone Continuous Distributions on High-dimensional Real Cubes.
Michal Adamaszek, Artur Czumaj, Christian Sohler
2010Testing Planarity of Partially Embedded Graphs.
Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter
2010The (1 + beta)-Choice Process and Weighted Balls-into-Bins.
Yuval Peres, Kunal Talwar, Udi Wieder
2010The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs.
Ken-ichi Kawarabayashi, Yusuke Kobayashi
2010The Focus of Attention Problem.
Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
2010The Forest Hiding Problem.
Adrian Dumitrescu, Minghui Jiang
2010The Power of Convex Relaxation: The Surprising Stories of Matrix Completion and Compressed Sensing.
Emmanuel J. Candès
2010The Rank of Diluted Random Graphs.
Charles Bordenave, Marc Lelarge
2010The Scaling Window for a Random Graph with a Given Degree Sequence.
Hamed Hatami, Michael Molloy
2010Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies.
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh S. Vempala
2010Towards a Calculus for Non-Linear Spectral Gaps.
Manor Mendel, Assaf Naor
2010Towards the Randomized k-Server Conjecture: A Primal-Dual Approach.
Nikhil Bansal, Niv Buchbinder, Joseph Naor
2010Tree Embeddings for Two-Edge-Connected Network Design.
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
2010Universal epsilon-approximators for Integrals.
Michael Langberg, Leonard J. Schulman
2010Utilitarian Mechanism Design for Multi-Objective Optimization.
Fabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre
2010Vertices of Degree k in Random Maps.
Daniel Johannsen, Konstantinos Panagiotou