1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2013
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
Per Austrin, Rajsekar Manokaran, Cenny Wenner
We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenne…
cs.CC2012
Complexity of Canadian Traveler Problem Variants
Dror Fried, Solomon Eyal Shimony, Amit Benbassat +1
The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked - a state which is revealed only upon reaching an incident ve…