NDLI: Hardness of cut problems in directed graphs

Please wait, while we are loading the content...

Explicit capacity-achieving list-decodable codes

The Santa Claus problem

Reducibility among equilibrium problems

Black-box constructions for secure computation

The changing face of web search: algorithms, auctions and advertising

On the solution-space geometry of random constraint satisfaction problems

Time-space tradeoffs for implementations of snapshots

Near-optimal algorithms for unique games

Finding a maximum weight triangle in $n^{3-Δ}$ time, with applications

The PCP theorem by gap amplification

A combinatorial characterization of the testable graph properties: it's all about regularity

Zero knowledge with efficient provers

A quasi-polynomial time approximation scheme for minimum weight triangulation

Conditional hardness for approximate coloring

Can every randomized algorithm be derandomized?

Finding small balanced separators

Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications

Pseudorandom walks on regular digraphs and the RL vs. L problem

Online trading algorithms and robust option pricing

Extractors for a constant number of polynomially small min-entropy independent sources

Logarithmic hardness of the directed congestion minimization problem

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Bounded-error quantum state identification and exponential separations in communication complexity

Truthful randomized mechanisms for combinatorial auctions

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction

A quasi-PTAS for unsplittable flow on line graphs

Gowers uniformity, influence of variables, and PCPs

On maximizing welfare when utility functions are subadditive

The complexity of computing a Nash equilibrium

Information-theoretically secure protocols and security under composition

Counting independent sets up to the tree threshold

Byzantine agreement in the full-information model in O(log n) rounds

New approximation guarantee for chromatic number

Time-space trade-offs for predecessor search

Graph limits and parameter testing

Zero-knowledge against quantum attacks

Building triangulations using ε-nets

Clique-width minimization is NP-hard

Graph partitioning using single commodity flows

A polynomial quantum algorithm for approximating the Jones polynomial

An efficient algorithm for solving word equations

On adequate performance measures for paging

Narrow proofs may be spacious: separating space and width in resolution

Hardness of cut problems in directed graphs

On the importance of idempotence

Limitations of quantum coset states for graph isomorphism

Fast convergence to Wardrop equilibria by adaptive sampling methods

Linear degree extractors and the inapproximability of max clique and chromatic number

Minimizing average flow time on related machines

Sub-constant error low degree test of almost-linear size

A randomized polynomial-time simplex algorithm for linear programming

New trade-offs in cost-sharing mechanisms

Private approximation of search problems

The DLT priority sampling is essentially optimal

Fast leader-election protocols with bounded cheaters' edge

Advances in metric embedding theory

Local zero knowledge

The distance trisector curve

Hardness of approximate two-level logic minimization and PAC learning with membership queries

Linear time low tree-width partitions and algorithmic consequences

On the fourier tails of bounded functions over the discrete cube

Integrality gaps for sparsest cut and minimum linear arrangement problems

Searching dynamic point sets in spaces with bounded doubling dimension

A new quantum lower bound method,: with applications to direct product theorems and time-space tradeoffs

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree

Deterministic extractors for small-space sources

Provably near-optimal sampling-based algorithms for Stochastic inventory control models

The effect of collusion in congestion games

Optimal phylogenetic reconstruction

Pricing for fairness: distributed resource allocation for multiple objectives

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs

Lattice problems and norm embeddings

On earthmover distance, metric labeling, and 0-extension

Learning a circuit by injecting values

New upper and lower bounds for randomized and quantum local search

On basing one-way functions on NP-hardness

A subset spanner for Planar graphs, with application to subset TSP

On the randomness complexity of efficient sampling

Edge-disjoint paths in Planar graphs with constant congestion

Hardness of cut problems in directed graphs

Content Provider	ACM Digital Library
Author	Khanna, Sanjeev Chuzhoy, Julia
Abstract	We study the approximability of the multicut and the (non-bipartite) sparsest cut problems in directed graphs. In the multicut problem, we are a given a graph G along with k source-sink pairs, and the goal is to find a smallest subset of edges whose deletion separates all source-sink pairs. The sparsest cut problem has the same input, but the goal is to find a subset of edges to delete so as to minimize the ratio of deleted edges to the number of source-sink pairs that are separated by this deletion. Study of algorithms for cut problems is intimately connected to the dual notion of flows in networks, and many approximation algorithms for cut problems use a flow solution as a starting point. The best known approximation algorithm for directed multicut is based on this approach and gives an O(√n)-approximation. On the other hand, the gap between the maximum multicommodity flow and the minimum multicut is known to be Ω(min(k , log n)). While this flow-cut gap may be interpreted as an evidence of inherent difficulty in designing good approximation algorithms for directed multicut, the strongest hardness result known is an APX-hardness. Even assuming the Unique Games Conjecture, only an ω(1)-hardness is known. Similar bounds hold for the directed sparsest cut problem.Our main result is that directed multicut is Ω(log n / log log n)-hard to approximate unless NP ⊆ DTIME (npolylog n). We show that this hardness result holds even when we allow a bicriteria relaxation, where the approximate solution is required to separate only a constant fraction of the pairs. This bicriteria hardness allows us to infer an Ω(log n / log log n)-hardness for the directed (non-bipartite) sparsest cut problem.
Starting Page	527
Ending Page	536
Page Count	10
File Format	PDF
ISBN	1595931341
DOI	10.1145/1132516.1132593
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-05-21
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Sparsest cut Directed multicut Hardness of approximation
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in