Chaudhuri et al., 2003 - Google Patents

Paths, trees, and minimum latency tours

Chaudhuri et al., 2003

View PDF
Document ID
14460410759565076095
Author
Chaudhuri K
Godfrey B
Rao S
Talwar K
Publication year
Publication venue
44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.

External Links

Snippet

We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.59-approximation to the minimum latency problem, improving on previous algorithms by a multiplicative factor of 2. Our techniques also give similar …
Continue reading at www.microsoft.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists

Similar Documents

Publication Publication Date Title
Chaudhuri et al. Paths, trees, and minimum latency tours
Elkin et al. Hopsets with constant hopbound, and applications to approximate shortest paths
Ausiello et al. On salesmen, repairmen, spiders, and other traveling agents
Sanders et al. Highway hierarchies hasten exact shortest path queries
Demaine et al. Bidimensionality: new connections between FPT algorithms and PTASs.
Gabow et al. Faster scaling algorithms for general graph matching problems
Krishnaswamy et al. The matroid median problem
Munari et al. A generalized formulation for vehicle routing problems
US7620947B2 (en) Enhanced directed graph representation for dependency systems
Breuils et al. Garamon: a geometric algebra library generator
Genova et al. An experimental evaluation of the best-of-many Christofides’ algorithm for the traveling salesman problem
US8280836B2 (en) Converting unordered graphs to oblivious read once ordered graph representation
D’Emidio et al. Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
Elkin et al. Linear-size hopsets with small hopbound, and distributed routing with low memory
Henzinger et al. Deterministic near-linear time minimum cut in weighted graphs
Orlin et al. A fast maximum flow algorithm
Alon et al. Strongly polynomial FPTASes for monotone dynamic programs
Förster et al. Directed graph exploration
Fremuth‐Paeger et al. Balanced network flows. i. a unifying framework for design and analysis of matching algorithms
JP2002522848A (en) Data structures and operations for time-varying variables in enterprise models
Hanaka et al. Parameterized orientable deletion
Zhao et al. Improved approximation algorithms for capacitated vehicle routing with fixed capacity
Gao et al. Approximation algorithms for time-window TSP and prize collecting TSP problems
Bergman et al. Theoretical insights and algorithmic tools for decision diagram-based optimization
Martin et al. Minimizing latency of capacitated k-tours