Pages that link to "Item:Q1430177"

The following pages link to Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177):

Displaying 2 items.

• An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
• Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)