Improved orientations of physical networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6293 LNBI, Issue , 2010, Pages 215-225

  Gamzu, Iftah ^a   Segev, Danny ^b   Sharan, Roded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL TASK; LOGARITHMIC APPROXIMATION; MIXED GRAPH; OPEN PROBLEMS; PERFORMANCE GUARANTEES; PHYSICAL NETWORK; POLYLOGARITHMIC APPROXIMATION; PROTEIN-DNA INTERACTIONS; UNDIRECTED GRAPH; VERTEX PAIRS; DIRECTED PATHS;

BIOINFORMATICS; CELL SIGNALING; DIRECTED GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 78049460830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15294-8_18     Document Type: Conference Paper

References (15)

1. Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, Chichester (2000)
2. Arkin, E.M., Hassin, R.: A note on orientations of mixed graphs. Discrete Applied Mathematics 116(3), 271-278 (2002)
3. Even, G., Garg, N., Könemann, J., Ravi, R., Sinha, A.: Covering graphs using trees and stars. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 24-35. Springer, Heidelberg (2003) (Pubitemid 137635831)
4. Feige, U., Goemans, M.X.: Aproximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In: Proceedings 3rd Israel Symposium on Theory and Computing Systems, pp. 182-189 (1995)
5. Frederickson, G.N., Johnson, D.B.: Generating and searching sets induced by networks. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 221-233. Springer, Heidelberg (1980)
6. Gamzu, I., Segev, D.: A sublogarithmic approximation for highway and tollbooth pricing. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (to appear, 2010), http://arxiv.org/abs/ 1002.2084
7. Goldschmidt, O., Hochbaum, D.S., Levin, A., Olinick, E.V.: The SONET edgepartition problem. Networks 41(1), 13-23 (2003)
8. Hakimi, S.L., Schmeichel, E.F., Young, N.E.: Orienting graphs to optimize reachability. Information Processing Letters 63(5), 229-235 (1997)
9. Hassin, R., Segev, D.: Robust subgraphs for trees and paths. ACM Transactions on Algorithms 2(2), 263-281 (2006)
10. Håstad, J.: Some optimal inapproximability results. Journal of the ACM 48(4), 798-859 (2001)
11. Kanehisa, M., Goto, S., Furumichi, M., Tanabe, M., Hirakawa, M.: KEGG for representation and analysis of molecular networks involving diseases and drugs. Nucleic Acids Research 38(2), D355-D360 (2010)
12. Khot, S., Kindler, G., Mossel, E., O'Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM Journal on Computing 37(1), 319-357 (2007)
13. Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2- SAT and MAX DI-CUT problems. In: Proceedings 9th International Conference on Integer Programming and Combinatorial Optimization, pp. 67-82 (2002)
14. Medvedovsky, A.: An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. Master's thesis, Tel-Aviv University, Israel (2009)
15. Medvedovsky, A., Bafna, V., Zwick, U., Sharan, R.: An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 222-232. Springer, Heidelberg (2008)