Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

Lecture Notes in Computer Science- Germany

doi 10.1007/3-540-44676-1_33

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

Exact Algorithms for Graph Homomorphisms

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2007English

Expander Flows, Geometric Embeddings and Graph Partitioning

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2009English

Expander Flows, Geometric Embeddings and Graph Partitioning

2004English

New Lower Bounds for Hopcroft's Problem

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1996English

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

An Exact Approach for the Multicommodity Network Optimization Problem With a Step Cost Function

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2019English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Minimax Lower Bounds for the Two-Armed Bandit Problem

SSRN Electronic Journal
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy