Amanote Research

Amanote Research

    RegisterSign In

Approximation Algorithms for Geometric Networks

doi 10.22215/etd/2008-06271
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
Mathieu Couture
Publisher

Carleton University


Related search

Optimal Algorithms and Approximation Algorithms for Replica Placement With Distance Constraints in Tree Networks

2012English

Approximation Algorithms for Computing Capacity of Wireless Networks With SINR Constraints

2008English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Geometric Algorithms for Layered Manufacturing

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
2005English

Improved Approximation Algorithms for Tree Alignment

Journal of Algorithms
1997English

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Approximation Algorithms for Fault Tolerant Facility Allocation

SIAM Journal on Discrete Mathematics
Mathematics
2013English

Approximation Algorithms for Finding Maximum Induced Expanders

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy