Sciweavers

    752 search results - page 9 / 151
    » Faster approximation algorithms for the minimum latency prob...
    Sort
    View
    IPCO
    2001
    184views Optimization» more  IPCO 2001»
    Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
    15 years 7 months ago
    Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
    Download  www.cs.dartmouth.edu
    Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
    Clifford Stein, David P. Wagner
    claim paper
    Read More »
    STOC
    1994
    ACM
    97views Algorithms» more  STOC 1994»
    An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
    15 years 10 months ago
    An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
    Download  www.cs.uwaterloo.ca
    Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
    Naveen Garg, Dorit S. Hochbaum
    claim paper
    Read More »
    144
    Voted
    IPPS
    2003
    IEEE
    115views Distributed And Parallel Com...» more  IPPS 2003»
    The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs
    15 years 11 months ago
    The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs
    Download  www.ibisc.univ-evry.fr
    Lélia Blin, Franck Butelle
    claim paper
    Read More »
    123
    Voted
    STOC
    1989
    ACM
    66views Algorithms» more  STOC 1989»
    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
    15 years 9 months ago
    The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
    Download  users.soe.ucsc.edu
    Leonard Pitt, Manfred K. Warmuth
    claim paper
    Read More »
    189
    Voted
    COCOON
    2007
    Springer
    158views Combinatorics» more  COCOON 2007»
    Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
    15 years 12 months ago
    Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
    Download  math.la.asu.edu
    We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
    Andrzej Czygrinow, Michal Hanckowiak
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.