Sciweavers

    79 search results - page 12 / 16
    » Minimum Dominating Set Approximation in Graphs of Bounded Ar...
    Sort
    View
    STOC
    2009
    ACM
    123views Algorithms» more  STOC 2009»
    An improved constant-time approximation algorithm for maximum~matchings
    14 years 8 months ago
    An improved constant-time approximation algorithm for maximum~matchings
    Download  www.lab2.kuis.kyoto-u.ac.jp
    This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
    Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
    claim paper
    Read More »
    KDD
    2009
    ACM
    188views Data Mining» more  KDD 2009»
    Mining discrete patterns via binary matrix factorization
    14 years 8 months ago
    Mining discrete patterns via binary matrix factorization
    Download  www.public.asu.edu
    Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
    Bao-Hong Shen, Shuiwang Ji, Jieping Ye
    claim paper
    Read More »
    INFORMS
    2008
    241views more  INFORMS 2008»
    Solving the Capacitated Local Access Network Design Problem
    13 years 7 months ago
    Solving the Capacitated Local Access Network Design Problem
    Download  wpweb2.tepper.cmu.edu
    We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
    F. Sibel Salman, R. Ravi, John N. Hooker
    claim paper
    Read More »
    ESA
    2003
    Springer
    189views Algorithms» more  ESA 2003»
    On the Complexity of Approximating TSP with Neighborhoods and Related Problems
    14 years 21 days ago
    On the Complexity of Approximating TSP with Neighborhoods and Related Problems
    Download  www.math.tu-berlin.de
    We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
    Shmuel Safra, Oded Schwartz
    claim paper
    Read More »
    SODA
    2008
    ACM
    128views Algorithms» more  SODA 2008»
    Analysis of greedy approximations with nonsubmodular potential functions
    13 years 9 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 »
    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.