Sciweavers

    JCSS
    2006
    51views more  JCSS 2006»
    Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
    13 years 11 months ago
    Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
    Download  www.ulb.ac.be
    Gilles Geeraerts, Jean-François Raskin, Lau...
    claim paper
    Read More »
    JCSS
    2006
    40views more  JCSS 2006»
    Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
    13 years 11 months ago
    Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
    Download  www.cs.dartmouth.edu
    Lisa Fleischer, Kamal Jain, David P. Williamson
    claim paper
    Read More »
    JCSS
    2006
    61views more  JCSS 2006»
    Planar graphs, negative weight edges, shortest paths, and near linear time
    13 years 11 months ago
    Planar graphs, negative weight edges, shortest paths, and near linear time
    Download  www.math.tu-dresden.de
    Jittat Fakcharoenphol, Satish Rao
    claim paper
    Read More »
    JCSS
    2006
    83views more  JCSS 2006»
    TSP with bounded metrics
    13 years 11 months ago
    TSP with bounded metrics
    Download  theory.cs.uni-bonn.de
    Lars Engebretsen, Marek Karpinski
    claim paper
    Read More »
    JCSS
    2006
    40views more  JCSS 2006»
    A parametric analysis of the state-explosion problem in model checking
    13 years 11 months ago
    A parametric analysis of the state-explosion problem in model checking
    Download  www.liafa.jussieu.fr
    Stéphane Demri, François Laroussinie...
    claim paper
    Read More »
    JCSS
    2006
    76views more  JCSS 2006»
    How much can taxes help selfish routing?
    13 years 11 months ago
    How much can taxes help selfish routing?
    Download  theory.stanford.edu
    Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    claim paper
    Read More »
    JCSS
    2006
    89views more  JCSS 2006»
    Ramsey-type theorems for metric spaces with applications to online problems
    13 years 11 months ago
    Ramsey-type theorems for metric spaces with applications to online problems
    Download  www.cs.umd.edu
    A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
    Yair Bartal, Béla Bollobás, Manor Me...
    claim paper
    Read More »
    JCSS
    2006
    36views more  JCSS 2006»
    Minimizing maximum fiber requirement in optical networks
    13 years 11 months ago
    Minimizing maximum fiber requirement in optical networks
    Download  ect.bell-labs.com
    Matthew Andrews, Lisa Zhang
    claim paper
    Read More »
    « first‹ previous12
    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.