Sciweavers

    SODA
    2008
    ACM
    89views Algorithms» more  SODA 2008»
    Linked decompositions of networks and the power of choice in Polya urns
    13 years 11 months ago
    Linked decompositions of networks and the power of choice in Polya urns
    Download  www.eecs.berkeley.edu
    Henry C. Lin, Christos Amanatidis, Martha Sideri, ...
    claim paper
    Read More »
    SODA
    2008
    ACM
    101views Algorithms» more  SODA 2008»
    Tight lower bounds for selection in randomly ordered streams
    13 years 11 months ago
    Tight lower bounds for selection in randomly ordered streams
    Download  people.csail.mit.edu
    Amit Chakrabarti, T. S. Jayram, Mihai Patrascu
    claim paper
    Read More »
    SODA
    2008
    ACM
    109views Algorithms» more  SODA 2008»
    Auctions for structured procurement
    13 years 11 months ago
    Auctions for structured procurement
    Download  www.math.cmu.edu
    This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
    Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
    claim paper
    Read More »
    SODA
    2008
    ACM
    82views Algorithms» more  SODA 2008»
    On properties of random dissections and triangulations
    13 years 11 months ago
    On properties of random dissections and triangulations
    Download  www.mpi-inf.mpg.de
    In the past decades the Gn,p model of random graphs, introduced by Erdos and R
    Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
    claim paper
    Read More »
    SODA
    2008
    ACM
    150views Algorithms» more  SODA 2008»
    Finding an optimal tree searching strategy in linear time
    13 years 11 months ago
    Finding an optimal tree searching strategy in linear time
    Download  www.cs.brown.edu
    We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
    Shay Mozes, Krzysztof Onak, Oren Weimann
    claim paper
    Read More »
    SODA
    2008
    ACM
    73views Algorithms» more  SODA 2008»
    Set connectivity problems in undirected graphs and the directed Steiner network problem
    13 years 11 months ago
    Set connectivity problems in undirected graphs and the directed Steiner network problem
    Download  www.cs.cmu.edu
    Chandra Chekuri, Guy Even, Anupam Gupta, Danny Seg...
    claim paper
    Read More »
    SODA
    2008
    ACM
    128views Algorithms» more  SODA 2008»
    Analysis of greedy approximations with nonsubmodular potential functions
    13 years 11 months ago
    Analysis of greedy approximations with nonsubmodular potential functions
    Download  www.math.ucsd.edu
    In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
    Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
    claim paper
    Read More »
    SODA
    2008
    ACM
    97views Algorithms» more  SODA 2008»
    Stochastic analyses for online combinatorial optimization problems
    13 years 11 months ago
    Stochastic analyses for online combinatorial optimization problems
    Download  www.cs.cmu.edu
    In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
    Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
    claim paper
    Read More »
    SODA
    2008
    ACM
    100views Algorithms» more  SODA 2008»
    Yet another algorithm for dense max cut: go greedy
    13 years 11 months ago
    Yet another algorithm for dense max cut: go greedy
    Download  www.cs.brown.edu
    We study dense instances of MaxCut and its generalizations. Following a long list of existing, diverse and often sophisticated approximation schemes, we propose taking the na
    Claire Mathieu, Warren Schudy
    claim paper
    Read More »
    SODA
    2008
    ACM
    156views Algorithms» more  SODA 2008»
    Approximating TSP on metrics with bounded global growth
    13 years 11 months ago
    Approximating TSP on metrics with bounded global growth
    Download  www.cs.cmu.edu
    The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
    T.-H. Hubert Chan, Anupam Gupta
    claim paper
    Read More »
    « first‹ previous…188189190191192193194195196…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.