Search results for "Combinatorial"

Hits ?▲	Authors	Title	Venue	Year	Link
16	Uriel Feige, Elchanan Mossel, Dan Vilenchik	Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Rajeev Motwani 0001, Rina Panigrahy, Ying Xu 0002	Fractional Matching Via Balls-and-Bins.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Yi-Kai Liu 0001	Consistency of Local Density Matrices Is QMA-Complete.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Zeev Nutov	Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Michael Langberg, Yuval Rabani, Chaitanya Swamy	Approximation Algorithms for Graph Homomorphism Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Samir Khuller, Yoo Ah Kim, Azarakhsh Malekian	Improved Algorithms for Data Migration.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Alexander Grigoriev, Maxim Sviridenko, Marc Uetz	LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	David P. Woodruff	Better Approximations for the Minimum Common Integer Partition Problem.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Benjamin E. Birnbaum, Kenneth J. Goldman	An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Nikhil Bansal 0001, Don Coppersmith, Baruch Schieber	Minimizing Setup and Beam-On Times in Radiation Therapy.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Petros Drineas, Michael W. Mahoney, S. Muthukrishnan 0001	Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Oded Goldreich 0001, Dana Ron	Approximating Average Parameters of Graphs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Retsef Levi, Maxim Sviridenko	Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Sanjeev Arora, Elad Hazan, Satyen Kale	A Fast Random Sampling Algorithm for Sparsifying Matrices.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Philipp Woelfel	Maintaining External Memory Efficient Hash Tables.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Nayantara Bhatnagar, Sam Greenberg, Dana Randall	The Effect of Boundary Conditions on Mixing Rates of Markov Chains.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Irit Dinur, Madhu Sudan 0001, Avi Wigderson	Robust Local Testability of Tensor Products of LDPC Codes.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Martin Marciniszyn, Jozef Skokan, Reto Spöhel, Angelika Steger	Threshold Functions for Asymmetric Ramsey Properties Involving Cliques.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Murali K. Ganapathy	Robust Mixing.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Alexander Healy	Randomness-Efficient Sampling Within NC1.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Shuchi Chawla 0001, Tim Roughgarden	Single-Source Stochastic Routing.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Chandra Chekuri, Martin Pál	An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum	Dobrushin Conditions and Systematic Scan.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
16	Jaewook Lee 0001	Pseudobasin of attraction for combinatorial dynamical systems: theory and its application to combinatorial optimization.	IEEE Trans. Circuits Syst. II Express Briefs	2005	DBLP DOI BibTeX RDF
16	Alejandro López-Ortiz, Angèle M. Hamel (eds.)	Combinatorial and Algorithmic Aspects of Networking, First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers	CAAN	2005	DBLP DOI BibTeX RDF
16	Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan (eds.)	Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Patric R. J. Östergård	Constructing combinatorial objects via cliques.	BCC	2005	DBLP BibTeX RDF
16	Joseph Cheriyan, Mohammad R. Salavatipour	Packing Element-Disjoint Steiner Trees.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Venkatesan Guruswami, Luca Trevisan	The Complexity of Making Unique Choices: Approximating 1-in- k SAT.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Jens Maßberg, Jens Vygen	Approximation Algorithms for Network Design and Facility Location with Service Capacities.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Sourav Chakraborty 0001, Jaikumar Radhakrishnan, Nandakumar Raghunathan	Bounds for Error Reduction with Few Quantum Queries.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Rémi Monasson	A Generating Function Method for the Average-Case Analysis of DPLL.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma	On the Error Parameter of Dispersers.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Uriel Feige, Eran Ofek	Finding a Maximum Independent Set in a Sparse Random Graph.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Dekel Tsur	Tight Bounds for String Reconstruction Using Substring Queries.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Alexander Hall, Christos H. Papadimitriou	Approximating the Distortion.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Shlomo Moran, Sagi Snir	Efficient Approximation of Convex Recolorings.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Julián Mestre	A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Venkatesan Guruswami, Atri Rudra	Tolerant Locally Testable Codes.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Viswanath Nagarajan, R. Ravi 0001	Approximation Algorithms for Requirement Cut on Graphs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Paul Valiant	The Tensor Product of Two Codes Is Not Necessarily Robustly Testable.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Stanislav Angelov, Sanjeev Khanna, Keshav Kunal	The Network as a Storage Device: Dynamic Routing with Bounded Buffers.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Victor Chepoi, Karim Nouioua, Yann Vaxès	A Rounding Algorithm for Approximating Minimum Manhattan Networks.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Boulos Harb, Sampath Kannan, Andrew McGregor 0001	Approximating the Best-Fit Tree Under Lp Norms.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Eyal Kaplan, Moni Naor, Omer Reingold	Derandomized Constructions of k-Wise (Almost) Independent Permutations.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Anupam Gupta 0001, Amit Kumar 0001	Where's the Winner? Max-Finding and Sorting with Metric Costs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Jeffrey C. Jackson, Rocco A. Servedio	On Learning Random DNF Formulas Under the Uniform Distribution.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Andrew McGregor 0001	Finding Graph Matchings in Data Streams.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Eyal Rozenman, Salil P. Vadhan	Derandomized Squaring of Graphs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Uriel Feige, Kunal Talwar	Approximating the Bandwidth of Caterpillars.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Vadim Lyubashevsky	The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	V. S. Anil Kumar 0001, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan	Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Gustav Hast	Beating a Random Assignment.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Shirley Halevy, Eyal Kushilevitz	A Lower Bound for Distribution-Free Monotonicity Testing.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi	A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Dana Randall, Peter Winkler 0001	Mixing Points on a Circle.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Anupam Gupta 0001, Martin Pál, R. Ravi 0001, Amitabh Sinha	What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Zeev Dvir, Amir Shpilka	An Improved Analysis of Mergers.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Adi Avidor, Uri Zwick	Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Jan Remy, Angelika Steger	Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Venkatesan Guruswami, Salil P. Vadhan	A Lower Bound on List Size for List Decoding.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Iannis Tourlakis	Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Martin Marciniszyn, Reto Spöhel, Angelika Steger	The Online Clique Avoidance Game on Random Graphs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Oded Lachish, Ilan Newman	Testing Periodicity.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
16	Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron (eds.)	Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Fabio Tardella	Connections between Continuous and Combinatorial Optimization Problems through an Extension of the Fundamental Theorem of Linear Programming.	CTW	2004	DBLP BibTeX RDF
16	Hervé Brönnimann, Nasir D. Memon, Kulesh Shanmugasundaram	String Matching on the Internet.	CAAN	2004	DBLP DOI BibTeX RDF
16	George Karakostas, Stavros G. Kolliopoulos	The Efficiency of Optimal Taxes.	CAAN	2004	DBLP DOI BibTeX RDF
16	Anthony Bonato, Jeannette C. M. Janssen	Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces.	CAAN	2004	DBLP DOI BibTeX RDF
16	Alejandro López-Ortiz	Algorithmic Foundations of the Internet: Foreword.	CAAN	2004	DBLP DOI BibTeX RDF
16	Andrei Z. Broder	Invited Talk: The Many Wonders of the Web Graph.	CAAN	2004	DBLP DOI BibTeX RDF
16	Alejandro López-Ortiz	Search Engines and Web Information Retrieval.	CAAN	2004	DBLP DOI BibTeX RDF
16	Jan van den Heuvel, Matthew Johnson 0002	The External Network Problem with Edge- or Arc-Connectivity Requirements.	CAAN	2004	DBLP DOI BibTeX RDF
16	André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi	k-Robust Single-Message Transmission.	CAAN	2004	DBLP DOI BibTeX RDF
16	Claus Bauer	Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches.	CAAN	2004	DBLP DOI BibTeX RDF
16	Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic	Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing.	CAAN	2004	DBLP DOI BibTeX RDF
16	Eythan Levy, Guy Louchard, Jordi Petit	A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs.	CAAN	2004	DBLP DOI BibTeX RDF
16	Jean-Loup Guillaume, Matthieu Latapy	Bipartite Graphs as Models of Complex Networks.	CAAN	2004	DBLP DOI BibTeX RDF
16	Jean-Charles Grégoire, Angèle M. Hamel	You Can Get There from Here: Routing in the Internet.	CAAN	2004	DBLP DOI BibTeX RDF
16	Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez, Alessandro Vespignani	Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis.	CAAN	2004	DBLP DOI BibTeX RDF
16	Anthony Bonato	A Survey of Models of the Web Graph.	CAAN	2004	DBLP DOI BibTeX RDF
16	Alejandro López-Ortiz	Algorithmic Foundations of the Internet: Roundup.	CAAN	2004	DBLP DOI BibTeX RDF
16	Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou	Congestion Games, Load Balancing, and Price of Anarchy.	CAAN	2004	DBLP DOI BibTeX RDF
16	Sung-woo Cho, Ashish Goel	Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives.	CAAN	2004	DBLP DOI BibTeX RDF
16	Mihaela Enachescu, Ashish Goel, Ramesh Govindan, Rajeev Motwani 0001	Aggregating Correlated Data in Sensor Networks.	CAAN	2004	DBLP DOI BibTeX RDF
16	Amin Coja-Oghlan, Andreas Goerdt, André Lanka	Strong Refutation Heuristics for Random k-SAT.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Moshe Babaioff, Liad Blumrosen	Computationally-Feasible Truthful Auctions for Convex Bundles.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira 0001, Ran Raz	Improved Randomness Extraction from Two Independent Sources.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Vittorio Bilò, Vineet Goyal, R. Ravi 0001, Mohit Singh	On the Crossing Spanning Tree Problem.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar 0001	The Sketching Complexity of Pattern Matching.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Abraham Flaxman, Alan M. Frieze	The Diameter of Randomly Perturbed Digraphs and Some Applications..	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Anupam Gupta 0001, Aravind Srinivasan, Éva Tardos	Cost-Sharing Mechanisms for Network Design.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Shirley Halevy, Eyal Kushilevitz	Distribution-Free Connectivity Testing.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani	Counting Connected Graphs and Hypergraphs via the Probabilistic Method.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Zoya Svitkina, Éva Tardos	Min-Max Multiway Cut.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Eli Ben-Sasson, Madhu Sudan 0001	Robust Locally Testable Codes and Products of Codes.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu	Estimating the Distance to a Monotone Function.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
16	Michael Ben-Or, Don Coppersmith, Michael Luby, Ronitt Rubinfeld	Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF